The guy who said this got it right:
"An O(log(n)) space complexity algorithm divides intervals in half."
Consider the first, middle and last items, then perform two recursive calls. That's all...
Type: Posts; User: iMalc
The guy who said this got it right:
"An O(log(n)) space complexity algorithm divides intervals in half."
Consider the first, middle and last items, then perform two recursive calls. That's all...