zoukankan      html  css  js  c++  java
  • Binary search for the first element greater than target

    We all know how to search through an array for an element whose value equals the target value, but how to search for the element that has value greater than the target value?

    A particularly elegant way of thinking about this problem is to think about doing a binary search over a transformed version of the array, where the array has been modified by applying the function

    f(x) = 1 if x > target
           0 else

    Now, the goal is to find the very first place that this function takes on the value 1. We can do that using a binary search as follows:

    int low = 0; high = numElems;
    while (low != high) {
        int mid = (low + high) / 2; // Or a fancy way to avoid int overflow
        if (arr[mid] <= target) {
            /* This index, and everything below it, must not be the first element
             * greater than what we're looking for because this element is no greater
             * than the element.
             */
            low = mid + 1.
        }
        else {
            /* This element is at least as large as the element, so anything after it can't
             * be the first element that's at least as large.
             */
            high = mid;
        }
    }
    /* Now, low and high both point to the element in question. */

    Reference: http://stackoverflow.com/questions/6553970/find-the-first-element-in-an-array-that-is-greater-than-the-target

  • 相关阅读:
    生成器
    IO调度算法
    进程与线程
    磁盘阵列(RAID)实例
    KVM虚拟化技术(七)虚拟机配置文件
    查询快递单号-京东快递接口
    快递单号查询快递鸟API接口-优速快递
    查询快递单号-德邦快递
    快递单号查询快递鸟API接口-EMS
    快递单号查询快递鸟API接口--安能快递
  • 原文地址:https://www.cnblogs.com/Antech/p/3834936.html
Copyright © 2011-2022 走看看