🤓Algorithms

In the updated version of the maTH library, we can also use sorting (currently, maybe more diverse in future) algorithms, so there is no need to write your own. It supports the following algorithms:

Algorithm	O notation (best, average, worst case)	Source
Bubble sort	$O(n^2)$, $O(n^2)$, $O(n^2)$	Bubble sort
Insertion sort	$O(n)$, $O(n^2)$, $O(n^2)$	Insertion sort
Selection sort	$O(n^2)$, $O(n^2)$, $O(n^2)$	Selection sort
Merge sort	$O(n log n)$, $O(n log n)$, $O(n log n)$	Merge sort
Quicksort	$O(n log n)$, $O(n log n)$, $O(n^2)$	Quicksort
Heap sort	$O(n log n)$, $O(n log n)$, $O(n log n)$	Heap sort
Count sort	$O(n + k)$, $O(n + k)$, $O(n + k)$	Count sort
Bucket sort	$O(n + k)$, $O(n)$, $O(n^2)$	Bucket sort
Radix sort	$O(nk)$, $O(nk)$, $O(nk)$	Radix sort