def hIndex(self, A):
        """
        Given sorted -> binary search
        From linear search into bin search
        :type A: List[int]
        :rtype: int
        """
        n = len(A)
        s = 0
        e = n
        while s < e:
            m = (s+e)/2
            if n-m >= A[m]:
                e = m
            else:
                s = m+1

        return n-s
dataset/ETHPy150Open algorhythms/LeetCode/275 H-Index II.py/Solution.hIndex/swapped operands of `>=`