C언어 배열의 특징과 연산방법을 설명한다.

#include <stdio.h>
#define MAX 100 // Maximum array size
int main(){
   int array[MAX];
   int size, i, search, found;
   printf("Enter size of array: ");
   scanf("%d", &size);
   printf("Enter elements in array: ");
   for(i=0; i<size; i++){
      scanf("%d", &array[i]);
   }
   printf("</p><p>Enter element to search: ");
   scanf("%d", &search);
   found = 0;
   for(i=0; i<size; i++){
      if(array[i] == search){
         found = 1;
         break;
      }
   }
   if(found == 1){
      printf("</p><p>%d is found at position %d", search, i + 1);
   } else {
      printf("</p><p>%d is not found in the array", search);
   }
   return 0;
}

Enter size of array: 5
Enter elements in array: 11 24 13 12 45
Enter element to search: 13
13 found at position 3found