In the JavaScript world, people share millions of pieces of code to avoid spending time on some necessary functionality, that is already done by others. Shared code, in turn, may depend on...Read more
Back in the days when JavaScript programs were small pieces of scripts that added a little interactivity to websites, there was no need to break the code into pieces. Today, JavaScript applications are rapidly growing in size...Read more
In the previous articles we had a short overview of the most popular sorting algorithms and their implementations. But there are many more things we should have a basic understanding of when dealing with this topic...Read more
The topic of today is Heap Sort - a sorting algorithm that is widely used because of its simplicity and efficiency. It uses heap data structure to find the largest element in each step...Read more
In this article, we will learn Selection Sort - a simple and easy-to-implement comparison algorithm, which serves as a basis for some of the most widely-used sorting algorithms, such as...Read more
Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time. It works best for small or almost sorted records and is not efficient for the larger or unsorted ones...Read more
Merge sort is an efficient sorting algorithm that was invented by John von Neumann in 1945. It follows the "divide-and-conquer" approach and works by dividing the unsorted list by (n) sublists, each containing one element...Read more
Quick Sort is one of the most popular sorting algorithms developed by the British computer scientist Tony Hoare in 1959 and published in 1961. If implemented well, it can be about two to three times faster than its main competitors...Read more
Sorting a list is one of the most common problems most programmers face. If you know many ways to perform a sorting operation, you can choose the best and most efficient one. In this article we will learn more about Bubble Sort and why it might be an inefficient choice...Read more