Skip to content

sort.md

Latest commit

 

History

History
11 lines (9 loc) · 615 Bytes

sort.md

File metadata and controls

11 lines (9 loc) · 615 Bytes

Sort

This package consiste of simple to complex sort algorithms

All function extend from root: el.

Functions

  • binarySort([ T, ]): [ T, ]. nb: T = number | string. O(nlogn) in worse case.
  • insertionSort([ T, ]): [ T, ]. nb: T = number | string. O(nlogn) in worse case and O(1/2 * n^2) on average.
  • mergeSort([ T, ]): [ T, ]. nb: T = number | string. O(n^2) in worse case and O(nlogn) on average.
  • selectionSort([ T, ]): [ T, ]. nb: T = number | string. O(n^2) in worse case.
  • shellSort([ T, ]): [ T, ]. nb: T = number | string. O(n^2) in worse case and O(nlogn) on average.