Consider the following algorithm that determines if two arrays have no elements in common. Assume that (a) the first array has n elements and the second array has m elements and that (b) the comparison on line 3 is the operation that counts towards running time. 1 FOR each element x on the first array
2. FOR each element y on the second array
3 IF x is equal to y then THEN
4. DISPLAY found common element
5 HALT
6 ENDIF
7 ENDFOR
8 ENDFOR
9 DISPLAY no elements in common
Q5.1: What is the best-case scenario?
Q5.2: What is the exact number of operations for the best-case scenario in terms of n and m?
Q5.3: What is the big-oh for the best-case scenario?
Q5.4: What is the worst-case scenario?
Q5.5: What is the exact number of operations for the worst-case scenario in terms of n and m?
Q5.6: What is the big-oh for the worst-case scenario?