Searching and Sorting Algorithms

Algorithms are pre made ways of doing gorbage

Bogo Sort

 * It could do it first try

Quick Sort

 * Selects a pivot and splits all items in the list as being either above or below it, creating smaller lists
 * Repeatedly does this until no more smaller lists can be created and joins all the lists together again creating the sorted list

Bubble Sort

 * Repeatedly steps through a list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order
 * The pass through the list is repeated until no swaps are needed which indicates that the list is sorted.

Selection Sort

 * Goes through the entire list and finds the smallest value, swapping it with the value in the first index
 * Repeats this step until the array is sorted
 * More efficient than bubble sort, but less efficient than quick sort

Linear Search

 * Search each element in a list sequentially for a given target value
 * Slower when searching through a large amount of elements

Binary Search

 * Think of it like the guess from 0 to 100 game, you guess 50 and then get if its higher lower and go 25 etc
 * Faster when searching through a large amount of elements