lower bound
RU: нижняя граница (lower bound)
In a sorted array, the first index whose value is greater than or equal to a given x, found by binary search in O(log n). In the O(n log n) LIS algorithm it locates the first tail >= x to overwrite.
RU: нижняя граница (lower bound)
In a sorted array, the first index whose value is greater than or equal to a given x, found by binary search in O(log n). In the O(n log n) LIS algorithm it locates the first tail >= x to overwrite.