Searching & Sorting Problems

Searching and Sorting:

1. Linear Search, Binary Search, Jump Search, Interpolation Search, Exponential Search, Ternary Search
2. Selection Sort, Bubble Sort, Insertion Sort, Merge Sort, Heap Sort, QuickSort, Radix Sort, Counting Sort, Bucket Sort, ShellSort, Comb Sort, Pigeonhole Sort, Cycle Sort
3. Interpolation search vs Binary search
4. Stability in sorting algorithms
5. When does the worst case of Quicksort occur?
6. Lower bound for comparison based sorting algorithms
7. Which sorting algorithm makes minimum number of memory writes?
8. Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted
9. Merge Sort for Linked Lists
10. Sort a nearly sorted (or K sorted) array
11. Iterative Quick Sort
12. QuickSort on Singly Linked List
13. QuickSort on Doubly Linked List
14. Find k closest elements to a given value
15. Sort n numbers in range from 0 to n^2 – 1 in linear time
16. A Problem in Many Binary Search Implementations
17. Search in an almost sorted array
18. Sort an array in wave form
19. Why is Binary Search preferred over Ternary Search?
20. K’th Smallest/Largest Element in Unsorted Array
21. K’th Smallest/Largest Element in Unsorted Array in Expected Linear Time
22. K’th Smallest/Largest Element in Unsorted Array in Worst Case Linear Time
23. Find the closest pair from two sorted arrays
24. Find common elements in three sorted arrays
25. Given a sorted array and a number x, find the pair in array whose sum is closest to x
26. Count 1’s in a sorted binary array
27. Binary Insertion Sort
28. Insertion Sort for Singly Linked List
29. Why Quick Sort preferred for Arrays and Merge Sort for Linked Lists?
30. Merge Sort for Doubly Linked List

Recent Articles on Searching

Recent Articles on Sorting

Quiz on Searching

Quiz on Sorting

Coding Practice on Searching

Coding Practice on Sorting