Timeline for Is there a O(log n)-time algorithm to find the maximum element of a circular shift of a sorted array?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 2, 2019 at 14:59 | vote | accept | user3760100 | ||
| Nov 2, 2019 at 11:14 | history | edited | Steven | CC BY-SA 4.0 |
edited body
|
| Nov 2, 2019 at 11:13 | comment | added | Steven | Ughh. You are right! Thanks for spotting that. | |
| Nov 2, 2019 at 11:07 | comment | added | Vimal Patel | No doubt this is a great answer as per me. But, I think we should consider $x$ as majority of $sign(a_1-a_n), sign(a_2-a_1)$ and $sign(a_3 - a_2)$. Because I'm getting wrong answer if I follow above approach with sequence $6,3,4,5$. | |
| Nov 2, 2019 at 10:42 | history | answered | Steven | CC BY-SA 4.0 |