Question

A linear search of a list involves checking every element in order until the target is found. Write the pseudocode for a linear search. Now imagine an algorithm that examines a list for duplicates. To determine if at least one duplicate exists, the algorithm examines item 1 and then compares it to all other items. If it finds a match, the search is over. If not, it tries item 2 and so on. Write the pseudocode for this algorithm.

Answer 1

Hint:
You will need two loops,
Set found=false
first loop starts from i=1 to n-1
the inner loop starts from j=i+1 to n
do comparison : set found = true if match found and exit loops
Print result