Linear Search program in C

#include <stdio.h> void main() { int array[10]; int i, num, keynum, found = 0; printf("Enter the value of num \n"); scanf("%d", &num); printf("Enter the elements one by one \n"); for (i = 0; i < num; i++) { scanf("%d", &array[i]); } printf("Input array is \n"); for (i = 0; i < num; i++) { printf("%d\n", array[i]); } printf("Enter the element to be searched \n"); scanf("%d", &keynum); /* Linear search begins */ for (i = 0; i < num ; i++) { if (keynum == array[i] ) { found = 1; break; } } if (found == 1) printf("Element is present in the array\n"); else printf("Element is not present in the array\n"); } Efficiency of Linear Search: To find the number of key comparisons for a successful match, we can add the number required for each comparison and divide by the total number of elements in the list: (1+2+3+4+....+n)/n=n(n+1)/2n