In computer science, linear search or sequential search is a method for finding a particular value in a list, that consists of checking every one of its elements, one at a time and in sequence, until the desired one is found. [1]For example, consider the following array of integers:Let us imagine we are searching for the number 21. First, go to the first element of the array.Is it equal to 21? No. Then move to the next...