Update 01_binary_search.c (egonSchiele#74)

whiteeagle44 · egonSchiele · commit 68a20e35eb55 · 2018-07-18T16:01:24.000-07:00
diff --git a/01_introduction_to_algorithms/c/01_binary_search.c b/01_introduction_to_algorithms/c/01_binary_search.c
@@ -1,5 +1,4 @@
 #include <stdio.h>
-#include <math.h>
 
 int binarySearch(int[], int, int);
 
@@ -19,7 +18,7 @@ int binarySearch(int list[], int item, int len)
     int high = len;
     while (low <= high)
     {
-        int mid = floor((low + high) / 2); //math.h floor
+        int mid = (low + high)/2; 
         int guess = list[mid];
 
         if (guess == item)
@@ -35,5 +34,5 @@ int binarySearch(int list[], int item, int len)
             low = mid + 1;
         }
     }
-    return -1; //number not find
+    return -1; //number not found
 }

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,4 @@`
`1`	`1`	`#include <stdio.h>`
`2`		`-#include <math.h>`
`3`	`2`
`4`	`3`	`int binarySearch(int[], int, int);`
`5`	`4`
`@@ -19,7 +18,7 @@ int binarySearch(int list[], int item, int len)`
`19`	`18`	`int high = len;`
`20`	`19`	`while (low <= high)`
`21`	`20`	`{`
`22`		`- int mid = floor((low + high) / 2); //math.h floor`
	`21`	`+ int mid = (low + high)/2;`
`23`	`22`	`int guess = list[mid];`
`24`	`23`
`25`	`24`	`if (guess == item)`
`@@ -35,5 +34,5 @@ int binarySearch(int list[], int item, int len)`
`35`	`34`	`low = mid + 1;`
`36`	`35`	`}`
`37`	`36`	`}`
`38`		`- return -1; //number not find`
	`37`	`+ return -1; //number not found`
`39`	`38`	`}`