# Algorithms (khan academy)

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