Algorithms

Sorting, searching and bin packing

An algorithm is a finite list of precise instructions. Bubble sort compares neighbours and swaps; quick sort splits around a pivot. Bin packing puts items into the fewest bins: first-fit, first-fit decreasing (FFD) and full-bin methods, compared with the lower bound $\left\lceil\frac{\text{total}}{\text{bin size}}\right\rceil$.