> For the complete documentation index, see [llms.txt](https://stephanosterburg.gitbook.io/scrapbook/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://stephanosterburg.gitbook.io/scrapbook/math/algorithm-khan-academy.md).

# Algorithms (khan academy)

- [Binary Search](https://stephanosterburg.gitbook.io/scrapbook/math/algorithm-khan-academy/binary-search.md)
- [Asymptotic notation](https://stephanosterburg.gitbook.io/scrapbook/math/algorithm-khan-academy/asymptotic-notation.md)
- [Sorting](https://stephanosterburg.gitbook.io/scrapbook/math/algorithm-khan-academy/sorting.md)
- [Insertion sort](https://stephanosterburg.gitbook.io/scrapbook/math/algorithm-khan-academy/insertion-sort.md)
- [Recursion](https://stephanosterburg.gitbook.io/scrapbook/math/algorithm-khan-academy/recursion.md)
- [Solve Hanoi recursively](https://stephanosterburg.gitbook.io/scrapbook/math/algorithm-khan-academy/solve-hanoi-recursively.md)
- [Merge Sort](https://stephanosterburg.gitbook.io/scrapbook/math/algorithm-khan-academy/merge-sort.md)
- [Representing graphs](https://stephanosterburg.gitbook.io/scrapbook/math/algorithm-khan-academy/representing-graphs.md)
- [The breadth-first search algorithm](https://stephanosterburg.gitbook.io/scrapbook/math/algorithm-khan-academy/the-breadth-first-search-algorithm.md)
- [Breadth First Search in JavaScript](https://stephanosterburg.gitbook.io/scrapbook/math/algorithm-khan-academy/breadth-first-search-in-javascript.md)
- [Breadth-first vs Depth-first Tree Traversal in Javascript](https://stephanosterburg.gitbook.io/scrapbook/math/algorithm-khan-academy/breadth-first-vs-depth-first-tree-traversal-in-javascript.md)