Data_Structure/資料結構光碟檔/CH14/sequentialSearch.c.txt

34 lines
776 B
Plaintext
Raw Normal View History

2025-01-20 21:25:33 +08:00
/* file name: sequentialSearch.c */
/* <20>`<60>Ƿj<C7B7>M */
#include <stdio.h>
#include <stdlib.h>
int main()
{
int data[10] = {75, 23, 98, 44, 57, 12, 29, 64, 38, 82};
int i, input;
printf("\n<< Squential search >>\n");
printf("\n<><6E><EFBFBD>Ʀp<C6A6>U: ");
for (i = 0; i < 10; i++)
printf("%d ", data[i]);
printf("\n");
printf("\n<>п<EFBFBD><D0BF>J<EFBFBD>n<EFBFBD><6E><EFBFBD>M<EFBFBD><4D><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: ");
scanf("%d", &input);
printf("\nSearching.....\n");
/* <20>̧Ƿj<C7B7>M<EFBFBD><4D><EFBFBD><EFBFBD> */
for (i = 0; i < 10; i++) {
printf("\n<><6E><EFBFBD>M<EFBFBD><4D> %2d <20><><EFBFBD>A<EFBFBD><41><EFBFBD>ƬO %d", i+1, data[i]);
if(input == data[i])
break;
}
if (i == 10)
printf("\n\n<><6E><EFBFBD>p, %d <20><EFBFBD><E4A4A3>!", input);
else
printf("\n\n<><6E><EFBFBD><EFBFBD><EFBFBD>F, %d <20>b<EFBFBD>}<7D>C<EFBFBD><43><EFBFBD><EFBFBD> %d <20><>!", input, i+1);
printf("\n");
return 0;
}