SDUWH - 《高级程序设计语言（C）》 - 实战三

其他pta题目见我的专栏，有sduwh的全套C语言pta题目及答案

​​​​​​​

6-1 exercise 3-1 BinarySearch

Our binary search(see page 58, section 3.3) makes two tests inside the loop, when one would suffice (at the price of more tests outside.) Write a version with only one test inside the loop and measure the difference in run-time.

Please use the code in the book.

函数接口定义：

int binsearch_naive(int x, int v[ ], int n);

find x in v[0] <= v[1] <= ... <= v[n-1].
If x is in the array v, return the index, else return -1.

裁判测试程序样例：

#include <stdio.h>

int binsearch_naive(int x, int v[ ], int n);
int compare (const void * a, const void * b);

int main ()
{
    int n; //数组大小
    int m; //询问的数量

    scanf("%d", &n);

    i