Question 3 Linear or sequential search algorithm is a process that can be carried out to determine if an element exist in an array of elements. With you knowledge with search algorithms extensively...

Question 3

Linear or sequential search algorithm is a process that can be carried out to determine if an

element exist in an array of elements. With you knowledge with search algorithms extensively

explain using algorithms, mathematical notations or diagrams to:

1. The worst case and best case time complexity of this search algorithm


2. Cases when is best applied

Using this finite set of integers as the input array {90 33 82 16 12 7 0}

iii. Develop a java or C++ program that can accept the input array and search for any

element the user input as the search element.

NB: User should be prompt in the element do not exist in the array