02331_数据结构_第8章_查找

 1 #define _CRT_SECURE_NO_WARNINGS
 2 
 3 #include<stdio.h>
 4 #include<stdlib.h>
 5 
 6 main()
 7 {
 8     int a[1024];
 9     int i;
10 
11     for (i = 0;i < 1024;i++)
12     {
13         a[i] = i;
14     }
15 
16     int num = 33;
17     int shang = 0;
18     int xia = 1023;
19     int zhong;
20 
21     while (shang < xia)
22     {
23         zhong = (shang + xia) / 2;
24         printf("shang=%d,zhong=%d,xia=%d\n", shang, zhong, xia);
25 
26         if (num == a[zhong])
27         {
28             printf("找到");
29             break;
30         }
31         else if (num>a[zhong])
32         {
33             shang = zhong + 1;
34         }
35         else
36         {
37             xia = zhong - 1;
38         }
39     }
40 
41     system("pause");
42 }