# 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

--- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://math-5.gitbook.io/math/reference/algorithms.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.