Question

Consider an array 'a[n]' in which you are searching for the first occurrence of integer 'x'. With the given pseudocode:

for (i=0; I < n; i++)

   if (x==a[i]) return i;

if (i==n) return -2;

e) x=5; a[] = {3,2,5,7,1}; How many times the loop is executed?

f) x=5; a[] = {5,2,3,7,1]; How many times the loop is executed?

g) x=5; a[] = {6,2,3,7,1}; How many times the loop is executed?

h) Provide example of an input sequence which would result in the worst case scenario for this algorithm.

Answer 1

e)
x=5;
a[]={3,2,5,7,1}
The loop runs for 3 times
at i=0 not matched
at i=1 not matched
at i=2 , x is matched

f)
x=5;
a[ ]={5,2,3,7,1 }
The loop runs for one time
at i=0 , x=5 matched
  
g)
x=5 ; a[ ]={6,2,3,7,1}
The i=0, not matched to 5
at i=1, not matched to 5
at i=2, not matched to 5
at i=3 not matched to 5
at i=4 not matched to 5
the loop runs for 5 times.
  
h) The worst case scenario runs for 5 times without matching.
x=5, a[]={2,3,4,6,7}