# Data Structures

### C program for quick sort algorithm

C program for Quick Sort Algorithm : Quick sort is a divide and conquer algorithm. Quick sort first divides a large list into two smaller sub-lists: the low elements and the high elements. Quick sort can then recursively sort the sub-lists. Let us see how quick sort algorithm works : Pick an element, called a pivot, from the list. Reorder the list...

### C program for Bucket sort algorithm

C program for Bucket sort algorithm : Bucket sort, or bin sort, is a sorting algorithm that works by partitioning an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm. Let us see how Bucket sort algorithms works : Set up an array...

### C program for Bogo sort algorithm

C program for Bogo sort algorithm : Bogosort Algorithm is also known as stupid sort or slow sort. Bogo sort is a particularly ineffective sorting algorithm based on the generate and test paradigm. It is not useful for sorting, but it is useful for educational purposes, to contrast it with other more realistic algorithms. It has also been used...

### C program for Binary Tree Sort Algorithm

C program for Binary Tree sort Algorithm : A Binary tree sort algorithm is a sorting algorithm that builds a binary search tree from the values or keys to be sorted, and then traverses the tree (in-order) so that the values or keys come out in sorted order. Its basically used when when sorting of elements has to be...

### C program for Binary search algorithm

C program for binary search algorithm : Binary search is a searching algorithm which searches an element in the sorted list. In each step,binary search algorithm compares the input number(to be searched) with the value of the middle element of the array. If the values match, then a matching element has been found so its index, or position, is...

### C program of Merge Sort Algorithm | C code Champ

C program of Merge sort algorithm : Merge sort is based on the divide-and-conquer paradigm. Its worst-case running time has a lower order of growth than insertion sort. Since we are dealing with sub problems, we state each sub problem as sorting a sub array A. Initially, p = 1 and r = n, but these values change as...