二分查找完整代码例子

#include <stdio.h>
#include <stdlib.h>

typedef int ElementType;

typedef struct {
    int element[16];
    int length;
}StaticTable;


//二分法查找
int BinarySearch(StaticTable* Tbl, ElementType K)
{//在表TB了中查找关键字为K的数据元素
    int left, right, mid, NotFound = -1;
    left = 1;                //初始左边界
    right = Tbl->length;    //初始右边界
    while (left <= right)
    {
        mid = (left + right) / 2;            //计算中间元素坐标
        if (K < Tbl->element[mid]) right = mid - 1;        //调整有边界
        else if (K > Tbl->element[mid]) left = mid + 1;    //调整做边界
        else    return mid;        //查找成功，返回数据元素的下标
    }
    return NotFound;        //查找不成功，返回-1；
}


//顺序查找
int Index(StaticTable *Tbl, ElementType K)
{
    int i ;
    Tbl->element[0] = K;
    for (i = Tbl->length; Tbl->element[i] != K; i--);
    return i;
}



int main()
{
    StaticTable * Tb1 = (StaticTable*)malloc(sizeof(StaticTable));
    Tb1->length = 15;
    for (int i = 1; i < 16; i++)
    {
        Tb1->element[i] = i + 1;
    }

    int index1 = BinarySearch(Tb1, 15);
    printf("%d\n", index1);

    int index2 = Index(Tb1, 5);
    printf("%d\n", index2);
    return 0;
}