algorithms

Merge sort is a great general purpose sorting algorithm. In fact some browsers have even used it for Array.prototype.sort(). It is comparison based and »

Quick sort is one of the more performant sorting algorithms, having an average complexity of O(n log n), though the worst case is still O( »

Insertion sort is another simple sorting algorithm, often taught initially with bubble sort and selection sort. I found this to be harder to conceptualize for some »

Selection sort is a basic sorting algorithm. It's an in-place comparison sort. It's generally considered to be not performant enough, but does have some use cases »

Bubble sort is one of the basic sorting algorithms. It gets its name because it bubbles up the values. It works by making passes through the »

Binary search is a great way to improve lookup time on a sorted data set. You can go from O(n) to O(log n), which »