1. A linear search of a list involves checking every element in order until the target is found. Write the pseudocode for a linear search.

2. 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

Question

1. A linear search of a list involves checking every element in order until the target is found. Write the pseudocode for a linear search. 

2. 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

anonymous · Answer

loop over starting at the first index
    loop over starting at the 2nd
        compare Array[i] and Array[j]