数据结构笔记#二分法查找

复习一下

#include <stdio.h>

struct List
{
    int array[20];
    int Length;
};
typedef struct List LIST;

int BinarySearch(LIST *list,int k) {
    int left, mid, right;
    left = 1;
    right = list->Length;
    while (left <= right) {
        mid = (left + right) / 2;
        if (k < list->array[mid]) {
            right = mid - 1;
        }
        else if (k > list->array[mid]) {
            left = mid + 1;
        }
        else {
            return mid;
        }
    }
    return -1;
}

int main() {
    LIST list;
    list.Length = 0;
    int lop = 0, input = 0, target;
    scanf("%d", &input);
    while (input != 999) {
        list.array[lop] = input;
        lop++;
        list.Length++;
        scanf("%d", &input);
    }
    for (lop = 0; lop < list.Length; lop++) {
        printf("%d ", list.array[lop]);
    }
    printf("
");

    scanf("%d", &target);
    printf("The Number %d found at No.%d
", target, BinarySearch(&list, target) + 1);
    return 0;
}