------------------------------------------- In computer science, a linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched. A simple approach is to do linear search, i.e 1. Start from the leftmost element of arr[] and one by one compare x with each element of arr[] 2. If x matches with an element, return the index. 3. If x doesn’t match with any of elements, return -1. We will be implementing linear search program in C++ Programming Language.