Linear search - checkes a list in order till the item needed is found. is slow
binery search - splits the ORDERED list in half and compaires sides. pickes the half list with the item in it and repeats
https://admin.dev42.co.uk/sort
bubble sort - LINK - compaires 2 values and moves the biggest one to the right. does this till a full run with no swaps
merge sort - splits the list in half, then again till all the bits are seperate. then in reverce, the larger item is put on the right in order.
Recursion - where the function calls on its self
Pre-order - root to left to right - In-Order - left to root to right - addending order Post_Order - Left to right to Root - calculating size