by Yung L. Leung
Let’s go through each of these in more detail.
A merge sort separates a list into its individual items. It then sorts them as they are being merged into a growing ordered list.
In practice, this would mean continuously slicing an array into single element arrays, before pushing each element into a larger array (the smaller value first). Every stage of pushing elements from 2 smaller arrays into 1 larger array involves determining which element from which array has the smaller value.
The complexity of merge sort is O((n log n) + 1). Remember that Big O notation (Complexity of Simple Algorithms & Data Structures in JS) is a count of the number of operations (O) with respect to the number of elements (n). So a 4 element list requires 3 splits. Note, the list is already ordered for the simplicity of the example.
Merging the 4 arrays requires 6 comparisons.
So, the mathematical calculation is as follows:
For simplicity, the complexity of merge sort is O(n log n). The +1 is insignificant relative to the value of n log n and log base 2 is assumed.
A quick sort selects a value (at index 0), swaps all lesser values closer to it, then makes a final swap to place the selected value ahead of the lesser values (an index somewhere after 0). In this manner, all values behind the pivot value are lesser values. All values ahead of it are greater values. Hence, upon pivoting, the selected value (pivot) is placed into its correct position. The process repeats until all values are “pivoted” to their correct positions.
Similar in practice to merge sort, quick sort requires splitting a list into smaller lists. Rather than sorting on merge, a pivot is selected to order the list such that lesser values are to its left & greater values are to its right. Therefore, it is no surprise that, like merge sort, quick sort also has a complexity of O(n log n).
So, for a 4 element array, a pivot is selected & its correct position is found (i.e., 2 at index 0 belongs at index 1). During this discovery, 3 comparisons are made with the pivot value (2) to the remaining elements (4, 1 & 3).
The partially sorted array (1, 2, 4, 3) is then decomposed to find the pivot positions of value 1 and 4 (by comparison to value 3), before discovering the last pivot position (value 3). This amounts to 4 comparisons and the discovery of 4 pivot positions or:
A radix sort continuously orders a list of numbers by their base ten digit.
In this case, the numbers (101, 54, 305, 6, 81) are first ordered by their 0’s place digit, then, 10’s place digit & finally, 100’s place digit. In practice, this means creating buckets (digits 0 to 9) for storing numbers with common digits (i.e., 101 & 81 shares a common digit at 0’s place). Then, combining all numbers in their bucket order (starting with 0’s place: 101, 81, 54, 305, 6), before repeating the process over with the 10’s place digits. This continues until the highest placed digits are reached (i.e., 101 & 305 have 100’s place digits).
In general, the complexity of the radix sort is O(kn).
- n is the number of elements
- k is the average number of digits per element
The quantity of numbers to sort (n) is the number of times it is required to make deposits into these digit buckets. So the list of 101, 54, 305, 6, 81 requires at least 5 deposits. The higher the digits (k) of the number collection, the more times it is required to repeat the sorting process from 0’s, 10’s, 100’s, 1000’s, etc. So the list 101, 54, 305, 6, 81 requires 5 deposits for 0’s, 10’s & 100’s place. That’s a total of 3 x 5 = 15 deposits.
Learning advanced algorithms does not diminish the importance of the more basic ones. It is through the studying of basic algorithms that you learn about what it means to search or sort, simply. And from this study, you can begin to understand the problems that come with these basic algorithms.
Nothing is created in a vacuum. It starts with an idea. Where it goes from there is limited by the human mind and what we can do with the physical world around us. It is “always day one,” should you choose to expand your horizons.