BANK IBPS SO Mock Test (Pre + Mains) 2024 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
5
\(\frac{{\left (n)( {n - 1} \right)}}{2}\)
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters