why binary search ?

SREEKANTH · Post by **SREEKANTH** » Sat Apr 28, 2012 1:32 am

we have sequential search which is in o(n)

then y to go for binary search whose time=o(nlogn)+logn

o(nlogn) is for creating sorted array

if the soln u r saying is tht binary search is applied where already sorted input is available...

then can u giv examples of it?

or is there is any better anaylsis?

SREEKANTH · Post by **SREEKANTH** » Sat Apr 28, 2012 2:07 am

i think once using binary search... structure is geerated with in nlogn time.. but after that every search takes logn time on the corresponding pattern

SREEKANTH · Post by **SREEKANTH** » Sat Apr 28, 2012 2:08 am

can someone post better analysis?

brianfry713 · Post by **brianfry713** » Mon Apr 30, 2012 10:02 pm

What is your question? Yes O(log n) is faster than O(n). If there are a large number of queries=q and n is large then you might need a binary search.
Sequential search O(q*n)
Binary search O(n*log n)+O(q*log n)

Branzila · Post by **Branzila** » Fri Feb 13, 2015 8:32 am

Can anyone describe/elaborate the maximum subarray 2D algorithm with example?

OJ Board

why binary search ?

why binary search ?

Re: why binary search ?

Re: why binary search ?

Re: why binary search ?

Re: why binary search ?