50 Search & Sort Programs in C for Freshers
Search and Sort Programs
| # | Program Name | Description | Resources |
|---|---|---|---|
| 1 | Bubble Sort | Implement bubble sort algorithm | GeeksforGeeks |
| 2 | Selection Sort | Implement selection sort algorithm | GeeksforGeeks |
| 3 | Insertion Sort | Implement insertion sort algorithm | GeeksforGeeks |
| 4 | Merge Sort | Implement merge sort algorithm | GeeksforGeeks |
| 5 | Quick Sort | Implement quick sort algorithm | GeeksforGeeks |
| 6 | Heap Sort | Implement heap sort algorithm | GeeksforGeeks |
| 7 | Shell Sort | Implement shell sort algorithm | GeeksforGeeks |
| 8 | Counting Sort | Implement counting sort algorithm | GeeksforGeeks |
| 9 | Radix Sort | Implement radix sort algorithm | GeeksforGeeks |
| 10 | Bucket Sort | Implement bucket sort algorithm | GeeksforGeeks |
| 11 | Linear Search | Implement linear search algorithm | GeeksforGeeks |
| 12 | Binary Search | Implement binary search algorithm | GeeksforGeeks |
| 13 | Jump Search | Implement jump search algorithm | GeeksforGeeks |
| 14 | Interpolation Search | Implement interpolation search | GeeksforGeeks |
| 15 | Exponential Search | Implement exponential search | GeeksforGeeks |
| 16 | Sort Strings | Sort array of strings | GeeksforGeeks |
| 17 | Sort Structures | Sort array of structures | GeeksforGeeks |
| 18 | Sort Linked List | Sort a linked list | GeeksforGeeks |
| 19 | Stable Sort | Implement stable sorting | GeeksforGeeks |
| 20 | In-place Sort | Implement in-place sorting | GeeksforGeeks |
| 21 | Find First/Last Occurrence | Find first/last occurrence in sorted array | GeeksforGeeks |
| 22 | Count Occurrences | Count occurrences in sorted array | GeeksforGeeks |
| 23 | Find Peak Element | Find peak element in array | GeeksforGeeks |
| 24 | Find Missing Number | Find missing number in sequence | GeeksforGeeks |
| 25 | Find Pair with Sum | Find pair with given sum | GeeksforGeeks |
| 26 | Time Complexity Analysis | Analyze time complexity of algorithms | GeeksforGeeks |
| 27 | Space Complexity Analysis | Analyze space complexity of algorithms | GeeksforGeeks |
| 28 | Best/Worst Case Analysis | Analyze best/worst case scenarios | GeeksforGeeks |
| 29 | Compare Sorting Algorithms | Compare performance of sorting algorithms | GeeksforGeeks |
| 30 | Compare Search Algorithms | Compare performance of search algorithms | GeeksforGeeks |
| 31 | Ternary Search | Implement ternary search | GeeksforGeeks |
| 32 | Fibonacci Search | Implement Fibonacci search | GeeksforGeeks |
| 33 | Tim Sort | Implement Tim sort | GeeksforGeeks |
| 34 | Cube Sort | Implement cube sort | GeeksforGeeks |
| 35 | Cycle Sort | Implement cycle sort | GeeksforGeeks |
| 36 | Kth Smallest/Largest | Find kth smallest/largest element | GeeksforGeeks |
| 37 | Sort 0s, 1s, 2s | Sort array of 0s, 1s, and 2s | GeeksforGeeks |
| 38 | Merge Sorted Arrays | Merge two sorted arrays | GeeksforGeeks |
| 39 | Find Duplicates | Find duplicates in sorted array | GeeksforGeeks |
| 40 | Find Rotation Count | Find rotation count in sorted array | GeeksforGeeks |
| 41 | Median of Two Arrays | Find median of two sorted arrays | GeeksforGeeks |
| 42 | Closest Pair | Find closest pair in sorted array | GeeksforGeeks |
| 43 | Find Triplets | Find triplets with given sum | GeeksforGeeks |
| 44 | Search in Rotated Array | Search in rotated sorted array | GeeksforGeeks |
| 45 | Find Majority Element | Find majority element in array | GeeksforGeeks |
| 46 | Sort Nearly Sorted Array | Sort nearly sorted (or K sorted) array | GeeksforGeeks |
| 47 | Find Floor/Ceiling | Find floor and ceiling in sorted array | GeeksforGeeks |
| 48 | Find Minimum in Rotated Array | Find minimum in rotated sorted array | GeeksforGeeks |
| 49 | Find Fixed Point | Find fixed point in sorted array | GeeksforGeeks |
| 50 | Find Peak in 2D Array | Find peak element in 2D array | GeeksforGeeks |
Related Resources