Hi,
Thank you for the help in the last question (Thanks dknguyen and Gary).
Here's the question I'm struggling with:
You can find a value in a given array in time complexity of O(logN).
Say that all entries were moved according to a certain unknown pivot, for example:
12345 turns to 34512.
How can you find a value in this new array in the same time complexity?
Thanks for any help
Thank you for the help in the last question (Thanks dknguyen and Gary).
Here's the question I'm struggling with:
You can find a value in a given array in time complexity of O(logN).
Say that all entries were moved according to a certain unknown pivot, for example:
12345 turns to 34512.
How can you find a value in this new array in the same time complexity?
Thanks for any help