The Binary Search Algorithm cuts an array in half and compares the key to the middle item. Every iteration, it cuts it in half again and compares the key to the new middle item.
Compares one element of the array to every individual element, one at a time. It’s not very efficient, but is simple and gets the job done!
It compares elements to the one right next to them and arranges them accordingly.
It takes a big array and sorts it into multiple small arrays and then rearranges the big array.