engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Algorithms Searching, Sorting and Hashing Searching
The average successful search time for sequential search on ‘n’ items is
1
\(\frac{{\left( {n + 1} \right)}}{2}\)
2
\(\frac{n}{2}\)
3
\(\frac{{\left( {n - 1} \right)}}{2}\)
4
log(n) + 1