View difference between Paste ID: 0CQm2DJA and X4vq7cbC

-#include<stdio.h>
+#include <stdio.h>
- main()
+
- {
+int main()
-   int array[100], search, c, number;
+{
-
+   int c, first, last, middle, n, search, array[100];
-   printf("Enter the number of elements in array: \n");
+
-   scanf("%d",&number);
+   printf("Enter number of elements :\n");
-
+   scanf("%d",&n);
-   printf("Enter %d numbers : \n", number);
+
-   for ( c = 0 ; c < number ; c++ )
+   printf("Enter %d integers :\n", n);
-        scanf("%d",&array[c]);
+
-
+   for (c = 0; c < n; c++)
-   printf("Enter the number to Search : \n");
+      scanf("%d",&array[c]);
-   scanf("%d",&search);
+
-
+   printf("Enter value to find:\n");
-   for ( c = 0 ; c < number ; c++ )
+   scanf("%d", &search);
-   {
+
-     if ( array[c] == search )
+   first = 0;
-     {
+   last = n - 1;
-       printf("%d - is present at location - %d\n", search, c+1);
+   middle = (first+last)/2;
-       break;
+
-     }
+   while (first <= last) {
       if (array[middle] < search)
-
+         first = middle + 1;
-   if ( c == number )
+      else if (array[middle] == search) {
-     printf("%d - is not present in array.\n", search);
+         printf("%d - found at location - %d.\n", search, middle+1);
          break;
-
+      }
- }
+      else
          last = middle - 1;
 
       middle = (first + last)/2;
    }
    if (first > last)
       printf("Not found! %d - is not present in the list.\n", search);
 
    return 0;
 }