Sort n numbers in range from 0 to n^2 – 1 in linear time
Sort n numbers in range from 0 to n^2 – 1 in linear time - Searching and sorting - If we use Counting Sort, it would take...
Browse Category
Searching and Sorting
85 Articles
Iterative Quick Sort
Iterative Quick Sort - Searching and Sorting - Partition process is same in both recursive and iterative. The same...
Sort a nearly sorted (or K sorted) array
Sort a nearly sorted (K sorted) array - Searching and sorting - Given an array of n elements, where each element is at most...
Merge Sort for Linked Lists
Merge Sort for Linked Lists - Searching and Sorting - Merge sort is often preferred for sorting a linked list. The slow...
Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted
Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted -Searching and sorting - Given an...
Lower bound for comparison based sorting algorithms
Lower bound for comparison based sorting algorithms - Searching and sorting - A sorting algorithm is comparison based if it...
Which sorting algorithm makes minimum number of memory writes?
Which sorting algorithm makes minimum number of memory writes - Searching and Sorting - Minimizing the number of writes is...
When does the worst case of Quicksort occur?
When does the worst case of Quicksort occur? - Searching and sorting - Since these cases are very common use cases, the...
Stability in sorting algorithms
stability in sorting algorithms - Searching and Sorting - Some sorting algorithms are stable by nature like Insertion sort,...
Interpolation search vs Binary search
Interpolation search vs Binary search - Searching and Sorting - On average the interpolation search makes about log(log(n))...
