Notes
for nemo
Pages
Home
C / Linux
Data Structures & Algorithms
UVa Problems
Interview Problems
More
Tuesday, April 23, 2013
10611 - The Playboy Chimp
1- Don't store repeated elements to make it easier.
2- If binary search doesn't find the element, then (low & high) or (first & last) are the boundaries that we need.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment