数据结构与算法-顺序查找

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define N 20
int main()
{
 int i, key, a[N], flag=0;
 srand((unsigned)time(NULL));
 for(i = 0 ; i < N; i++)
 {
  a[i] = rand()%100;
  printf("%d\n",a[i]);
 }
 printf("please input a key\n");
 scanf("%d",&key);
 for(i = 0; i < N; i++)
 {
  if(a[i] == key)
  {
   flag = 1;
   break;
  }
 }
  if(flag == 1)
  {
   printf("The find is successful\n");
  }
        else
  {
      printf("The find is wrong\n");
  
  }
 return 0;
}