- A stable sorting algorithm works in O(n Log n) time
- Used in Java’s Arrays.sort() as well as Python’s sorted() and sort().
- First sort small pieces using Insertion Sort, then merges the pieces using merge of merge sort.
We divide the Array into blocks known as Run. We sort those runs using insertion sort one by one and then merge those runs using combine function used in merge sort. If the size of Array is less than run, then Array get sorted just by using Insertion Sort. The size of run may vary from 32 to 64 depending upon the size of the array. Note that merge function performs well when sizes subarrays are powers of 2. The idea is based on the fact that insertion sort performs well for small arrays.
Details of below implementation :
- We consider size of run as 32.
- We one by one sort pieces of size equal to run
- After sorting individual pieces, we merge them one by one. We double the size of merged subarrays after every iteration.
Given Array is 5 21 7 23 19 After Sorting Array is 5 7 19 21 23
This article is contributed by Aditya Kumar. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Find the winner of the Game
- Check whether the string S1 can be made equal to S2 with the given operation
- Sort the given stack elements based on their modulo with K
- Longest sub-sequence with non-negative sum
- Find if there exists a direction for ranges such that no two range intersect
- Find Partition Line such that sum of values on left and right is equal
- Sorting objects using In-Place sorting algorithm
- Maximum sum of minimums of pairs in an array
- Sort the numbers according to their product of digits
- Kth number from the set of multiples of numbers A, B and C
- Minimum increment or decrement operations required to make the array sorted
- Minimum steps required to reduce all the elements of the array to zero
- QuickSelect (A Simple Iterative Implementation)
- Choose X elements from A and Y elements from B which satisfy the given condition