Ternary Search Algorithm in C
Aditya Bhuyan Introduction The ternary search algorithm is a divide-and-conquer algorithm used for finding an element in a sorted array. It works by dividing the array into three parts instead of two,…
Algorithms
Exponential Search Algorithm in C
Introduction Exponential search is an algorithm for searching a sorted array. It works by first finding a range where the target element may reside. It does this by exponentially increasing…
Interpolation Search Algorithm in C
The Interpolation Search is an improved variant of binary search. It works on the principle of estimating the position of the target value based on the value’s range in a…
Binary Search Algorithm in C
Program Overview The binary search algorithm is an efficient method for finding a target value in a sorted array. It works by repeatedly dividing the search interval in half. If…
Heap Sort Algorithm in C
Overview Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure. It divides the input into a sorted and an unsorted region and iteratively shrinks the…
Quick Sort Algorithm in C
Program Explanation Quick Sort is a highly efficient sorting algorithm that uses the divide-and-conquer principle. It works by selecting a ‘pivot’ element from the array and partitioning the other elements…
Merge Sort Algorithm in C
Introduction Merge sort is a divide-and-conquer algorithm that sorts an array by recursively splitting it into two halves, sorting each half, and then merging the sorted halves back together. It…
Insertion Sort Algorithm in C
Program Code #include /** * Function to perform insertion sort on an array. * @param arr: Array to be sorted * @param n: Size of the array */ void insertionSort(int…
Selection Sort Algorithm in C
The Selection Sort algorithm is a simple and intuitive sorting algorithm. It works by repeatedly selecting the smallest (or largest, depending on the order) element from the unsorted portion of…
Bubble Sort Algorithm in C
Program Overview The Bubble Sort algorithm is a simple sorting technique that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.…
