Match the following. a) Completeness i) How long does it take to find a solution b)Time Complexity ii) How much memory need to perform the search. c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one. Explain A) a-iii, b-ii, c-i B) a-i, b-ii, c-iii C) a-iii, b-i, c-ii D) a-i, b-iii, c-ii
The number of comparisons done by sequential search of N elements in an array is ………………
A) (N/2)+1
B) (N+1)/2
C) (N-1)/2
D) N
Explain
Get Answers For Free
Most questions answered within 1 hours.