Hi,
Good ideal, pls try to keep posting. I like this topic very much and I will digged this one. Tks again.
I found some references on this subject, please refer to everyone here: [font=Arial][size=2]Marketing interview questions and answers[/font]
Best regards.
Google Interview Questions
[quote name='Antheus' timestamp='1301427890' post='4791860']
Binary search has worst-case O(logn).
Finding split point is O(n), so finding the point of rotation is several times more expensive than search itself.
Since array is sorted, recursive split can be used to determine which half is out of order. Predicates for binary search are: left < mid < right (equalities optional)
Oooo. I like that. I didn't realize it before.
[/quote]
And in my crusade against spambots, I accidentally downvoted this post. And apparently I cannot undo it. So someone upvote it.
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement