# Sorting Algorithms

Sorting Algorithms

### 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 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...

### C program for Selection Sort Algorithm | C Code champs

C program for Selection Sort Algorithm: Selection sort basically determines the minimum (or maximum) of the list and swaps it with the element at the index where its supposed to be. The process is repeated such that the nth minimum (or maximum) element is swapped with the element at the n-1th index of the list. The below is an...

### C program of Bubble Sort Algorithm | C Code Champs

Bubble sorting is a simple sorting technique in sorting algorithm. In bubble sorting algorithm, we arrange the elements of the list by forming pairs of adjacent elements. It means we repeatedly step through the list which we want to sort, compare two items at a time and swap them if they are not in the right order. Another way...