Describe the Binary Search approach and optimize it.
Typical Problems:
Question 1:
Suppose you have a sorted array of infinite numbers, how would you search an element in the array?
http://www.geeksforgeeks.org/find-position-element-sorted-array-infinite-numbers/
Question 2:
http://www.programcreek.com/2013/01/leetcode-search-insert-position/
Question 3:Guess Number is higher or lower
http://www.programcreek.com/2014/07/leetcode-guess-number-higher-or-lower-java/
Question 4:First Bad Version
http://www.programcreek.com/2014/05/leetcode-first-bad-version-java/
http://quiz.geeksforgeeks.org/binary-search/
http://www.geeksforgeeks.org/the-ubiquitous-binary-search-set-1/
http://www.geeksforgeeks.org/problem-binary-search-implementations/
http://www.geeksforgeeks.org/the-ubiquitous-binary-search-set-1/
http://www.geeksforgeeks.org/problem-binary-search-implementations/
Typical Problems:
Question 1:
Suppose you have a sorted array of infinite numbers, how would you search an element in the array?
http://www.geeksforgeeks.org/find-position-element-sorted-array-infinite-numbers/
Question 2:
http://www.programcreek.com/2013/01/leetcode-search-insert-position/
Question 3:Guess Number is higher or lower
http://www.programcreek.com/2014/07/leetcode-guess-number-higher-or-lower-java/
Question 4:First Bad Version
http://www.programcreek.com/2014/05/leetcode-first-bad-version-java/
This comment has been removed by the author.
ReplyDelete