Q1
Advantages:
•**The linear search is simple - It is very easy to understand and implement;
•**It does not require the data in the array to be stored in any particular order.
Disadvantages:
•**The linear search is inefficient - If the array being searched contains 20,000 elements, the algorithm will have to look at all 20,000 elements in order to find a value in the last element. In an average case, an item is just as likely to be found near the beginning of the array as near the end. Typically, for an array of N items, the linear search will locate an item in N/2 attempts. If an array has 50,000 elements, the linear search will make a comparison with 25,000 of them in a typical case. This is assuming that the search item is consistently found in the array.