The linear Search algorithm is one of the simplest search algorithms availble. The algorithm uses brute force to find the required value. It checks each memory location in turn until it finds the answer it is looking for. The algorithm only ends when it runs out of items to search through or when it finds a value lower than the one it is looking for.