Timeline for Locate all locations in a sorted array where arr[i]<arr[i+1]
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 23, 2017 at 20:51 | comment | added | user118462 | This is not about dereferencing pointers. Actually, in my paper we are asking O(1) time queries since these numbers are never stored in an array. But the theoretical question is the same as the one asked. How many comparisons are being done in the worst case? I think it needs calculus to somehow balance the O(k log n) with O(n). | |
| Aug 23, 2017 at 20:08 | history | answered | nadir | CC BY-SA 3.0 |