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...
Browse Tag
quicksort
29 Articles
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...
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,...
Comb Sort
Comb Sort - Searching and Sorting - Comb Sort is mainly an improvement over Bubble Sort. Bubble sort always compares...
ShellSort
ShellSort - Searching and Sorting - ShellSort is mainly a variation of Insertion Sort. In insertion sort, we move elements...
Bucket Sort
Bucket Sort - Searching and sorting - A simple way is to apply a comparison based sorting algorithm. The lower bound for...
Counting Sort
Counting sort - Searching and Sorting - Counting Sort is a sorting technique based on keys between a specific range. It...
