A linear search is simple: it goes through each element from the beginning before it is found. I fnto found, a error message will be returned.

Binary search uses recursion to find elements quickly. It finds the middle index of the array, compares the middle value to the value its on, and either cuts the left from the middle or the upper right from the middle.Then it'll do the recursive call again if the search isn't done. If the lower number exceeds the higher number, which means it's not in the list when the search is finished. It will stop early if IT FINDS IT.

Selection sort works by swapping the minimum value in the array to the front of a different array that is sorted, or done with. It continues to the next element until all elements are inside the second array.

​

Selection sort works by swapping the minimum value in the array to the front of a different array that is sorted, or done with. It continues to the next element until all elements are inside the second array.

​