# Sort

Admin | 07-Jun-2016 | C#, VB.Net, C, C++, PHP

Bead sort, also known as gravity sort, is a natural sorting algorithm, developed by Joshua J. Arulanandham, Cristian S. Calude and Michael J. Dinneen ...

## Bogo Sort

Admin | 07-Jun-2016 | C#, VB.Net, C, C++, PHP

Bogo sort, also known as permutation sort, stupid sort, slow sort, shotgun sort or monkey sort, is a particularly ineffective sorting algorithm ...

## Bubble Sort

Admin | 27-Sep-2015 | C#, VB.Net, C, C++, PHP

Bubble sort (a.k.a Sinking Sort and Comparison Sort) is a sorting algorithm that works by repeatedly swapping and adjacent elements if they are in ...

## Bucket Sort

Admin | 27-Sep-2015 | C#, VB.Net, C, C++, PHP

Bucket sort (a.k.a Bin Sort) is a sorting algorithm that works by partitioning an array into a number buckets. Each bucket then sorted ...

## Cocktail Shaker Sort

Admin | 02-Jun-2016 | C#, VB.Net, C, C++, PHP

Cocktail shaker sort, also known as bidirectional bubble sort, cocktail sort, shaker sort, ripple sort, shuffle sort, or shuttle sort, is a variation ...

## Comb Sort

Admin | 27-Sep-2015 | C#, VB.Net, C, C++, PHP

Comb sort is sorting algorithm and it is a variant of Bubble sort, the Comb Sort increases the gap used in comparisons and exchanges.

## Counting Sort

Admin | 27-Sep-2015 | C#, VB.Net, C, C++, PHP

Counting sort is sorting algorithm based on keys between specific range. It works by counting the number of objects having distinct key values. Then ...

## Gnome Sort

Admin | 01-Jun-2016 | C#, VB.Net, C, C++, PHP

Gnome sort also known as stupid sort is a sorting algorithm which is similar to insertion sort, except that moving an element to its proper place is ...

## Heap Sort

Admin | 27-Sep-2015 | C#, VB.Net, C, C++, PHP

Heap sort is a comparison based sorting algorithm. It is similar to selection sort where we first find the maximum element and place the maximum ...

## Insertion Sort

Admin | 27-Sep-2015 | C#, VB.Net, C, C++, PHP

Insertion sort is a sorting algorithm that builds the final sorted array one item at a time. It works the way we sort playing cards in our hands. It ...