Question

For a sequential search algorithm, the best case occurs when:

a.The search target is near the middle of the array
b.The search key is small
c.The algorithm is implemented efficiently
d.The array is small
e.The search target is near the front of the array

Answer 1

try asking search and assignment expert, they give best answers