Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?
Hint:
Expected runtime complexity is in O(log n) and the input is sorted.
Ternary search for unimodal functions: https://en.wikipedia.org/wiki/Ternary_search