Algorithms Searching, Sorting and Hashing Searching

What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size n?

1
θ(n)
2
θ(√n)
3
θ(log2(n))
4
θ(n2)

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