dynamic memory allocation and modified variable names

abiduzz420 · abiduzz420 · commit 579738f7a35f · 2017-11-24T11:18:36.000+05:30
diff --git a/search/Binary_Search.c b/search/Binary_Search.c
@@ -1,35 +1,38 @@
 #include<stdio.h>
+#include<stdlib.h>
+
 int main() {
  
- int n, a[30], item, i, j, mid, top, bottom;
+ int n_terms, *arr, item, i, j, mid, top, bottom;
  
  
  printf("Enter how many elements you want:\n");   // no of elements
- scanf("%d", &n);
- printf("Enter the %d elements in ascending order\n", n);    
- for (i = 0; i < n; i++) {
-  scanf("%d", &a[i]);
+ scanf("%d", &n_terms);
+ arr = (int*)malloc(sizeof(int)*n_terms);
+ printf("Enter the %d elements in ascending order\n", n_terms);    
+ for (i = 0; i < n_terms; i++) {
+  scanf("%d", &arr[i]);
  }
  
  printf("\nEnter the item to  search\n");   // Target element to be searched
  scanf("%d", &item);
  bottom = 1;
- top = n;
+ top = n_terms;
  
  do {
   mid = (bottom + top) / 2;
-  if (item < a[mid])
+  if (item < arr[mid])
    top = mid - 1;                            // Here we are dividing the array into two equal parts 
-  else if (item > a[mid])                   /* if target element > mid part of array , we do the search in the upper part of the array
+  else if (item > arr[mid])                   /* if target element > mid part of array , we do the search in the upper part of the array
                                             else search in the lower part */
    bottom = mid + 1;
- } while (item != a[mid] && bottom <= top);
+ } while (item != arr[mid] && bottom <= top);
  
- if (item == a[mid]) {
+ if (item == arr[mid]) {
   printf("Binary search successfull!!\n");
-  printf("\n %d found in position: %d\n", item, mid + 1);
+  printf("%d found in position: %d\n", item, mid + 1);
  } else {
-  printf("\n  Search failed\n %d not found\n", item);
+  printf("Search failed\n%d not found\n", item);
  }
  return 0;
 }
