Crate sort_algorithms

Functions

bubble_sort

Bubble sort is an algorithm that use order by comapare values.

cocktail_shaker_sort

Cocktail Shaker Sort is an algorithm is a derivation from bubble sort.

counting_sort

Counting Sort is an algorithm that use the strategy of it uses key values as indexes into an array and the lower bound for comparison sorting will not apply. !important only positive keys

flash_sort

Flash Sort is an algorithm that use the strategy that you can compute the approximate final position directly from the element value, with no comparisons.

gravity_sort

Counting Sort is an algorithm that use the strategy of it uses key values as indexes into an array and the lower bound for comparison sorting will not apply. !important only positive keys

heapsort

Heap sort is an generalist algorithm that use the strategy order by selecion.

insertion_sort

Insertion sort is an algorithm that use strategy where catch one element and compare against orthers.

merge_sort

Merge sort is an algorithm that use the strategy order by comparation and divide to conquer.

quick_sort

radix_sort

Radix sort is an algorithm that use the strategy non-comparative. !important only positive keys

selection_sort

Selection Sort is an algorithm that use order by selection. !important only positive keys