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