binary_search.c Add Binary Search Algorithm

README.md

@@ -21,7 +21,7 @@ This repository contains examples of various algorithms written on different pro
 | [Insertion Sort](https://en.wikipedia.org/wiki/Insertion_sort)                                  | [:octocat:](insertion_sort/C)         | [:octocat:](insertion_sort/Cpp)       |                                       | [:octocat:](insertion_sort/Python)    |
 | [Counting Sort](https://en.wikipedia.org/wiki/Counting_sort)                                    |[:octocat:](counting_sort/C)           | [:octocat:](counting_sort/Cpp)                                       |                                       | [:octocat:](counting_sort/Python)     |
 | [Radix Sort](https://en.wikipedia.org/wiki/Radix_sort)                                          |                                       | [:octocat:](radix_sort/Cpp)                                       |                                       | [:octocat:](radix_sort/Python)        |
-| [Binary Search](https://en.wikipedia.org/wiki/Binary_search_algorithm)                          |                                       | [:octocat:](binary_search/Cpp)        |                                       | [:octocat:](binary_search/Python)     |
+| [Binary Search](https://en.wikipedia.org/wiki/Binary_search_algorithm)                          | [:octocat:](binary_search/C)          | [:octocat:](binary_search/Cpp)        |                                       | [:octocat:](binary_search/Python)     |
 | [Bubble Sort](https://en.wikipedia.org/wiki/Bubble_sort)                                        | [:octocat:](bubble_sort/C)            | [:octocat:](bubble_sort/Cpp)          | [:octocat:](bubble_sort/Java)         | [:octocat:](bubble_sort/Python)            |
 | [Shell Sort](https://en.wikipedia.org/wiki/Shellsort)                                           | [:octocat:](shell_sort/C)             |                                       |                                       | [:octocat:](shell_sort/Python)        |
 | [Heap Sort](https://en.wikipedia.org/wiki/Heapsort)                                             |                                       |                                       |                                       | [:octocat:](heap_sort/python)        |

binary_search/C/binary_search.c

@@ -0,0 +1,25 @@
+#include <stdio.h>
+
+int binarySearch(int arr[], int start, int end, int item) {
+	int mid = start + (end-start) / 2;
+	while (start <= mid) {
+		if (arr[mid] == item) {
+			return mid;
+		} else if (arr[mid] > item) {
+			end = mid-1;
+		} else {
+			start = mid+1;
+		}
+		mid = start + (end-start) / 2;
+	}
+	return -1;
+}
+
+int main() {
+	int arr[] = {1, 3, 4, 4, 10, 13, 25, 26, 27, 60};
+	int n = 10;
+	int x = 13;
+	int result = binarySearch(arr, 0, n - 1, x);
+	printf("Index of %d in array is: %d\n", x, result);
+	return 0;
+}