BANK SEBI Grade A Phase 1 & Phase 2 Mock Test 2024 Algorithms Searching, Sorting and Hashing Sorting
Average number of comparison required for a successful search for sequential search on ‘n’ items is
1
\(n/2\)
2
\((n - 1)/2\)
3
\((n + 1)/2\)
4
\(n\)
5
\(n(n-n)/2\)