Sorting algorithms
1. Bubble sort - go through each element and if the next element is greater then swap
2. Insertion sort - go through each element and keep inserting in sorted list
3. Merge sort - divide and conquer using stitch(merge)
4. Quick sort - use a pivot and sort around the pivot

Data Structures Interfaces
Sets - cloud of non-duplicate values
maps - key value sets
stacks - last in first out
queue - first in first out