Day 28, 29 - C (#208)

* Create Linear_Search.c

* Update README.md

* Create Binary_Search.c

* Update README.md

* Update README.md

Author: ashwek

day28/C/Linear_Search.c

@@ -0,0 +1,46 @@
+/*
+ * @author : ashwek
+ * @date : 29/01/2019
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+
+int linear_search(int *arr, int n, int search){
+
+    int i;
+
+    for(i=0; i<n; i++){
+        if( arr[i] == search )
+            return i;
+    }
+
+    return -1;
+}
+
+void main(){
+
+    int *arr, n, search, i;
+
+    printf("Enter size of array = ");
+    scanf("%d", &n);
+
+    arr = (int *)malloc(sizeof(int)*n);
+
+    printf("Enter %d elements : ", n);
+    for(i=0; i<n; i++){
+        scanf("%d", &arr[i]);
+    }
+
+    printf("Enter a value to search = ");
+    scanf("%d", &search);
+
+    i = linear_search(arr, n, search);
+
+    if( i == -1 ){
+        printf("%d not found in array", search);
+    }
+    else{
+        printf("%d found at %d index", search, i);
+    }
+}

day28/README.md

@@ -73,4 +73,57 @@ public class linearSearch1 {
             System.out.println("undefined");
     }
 }
-```
+```
+
+## C Implementation
+
+### [Solution](./C/Linear_Search.c)
+
+```c
+/*
+ * @author : ashwek
+ * @date : 29/01/2019
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+
+int linear_search(int *arr, int n, int search){
+
+    int i;
+
+    for(i=0; i<n; i++){
+        if( arr[i] == search )
+            return i;
+    }
+
+    return -1;
+}
+
+void main(){
+
+    int *arr, n, search, i;
+
+    printf("Enter size of array = ");
+    scanf("%d", &n);
+
+    arr = (int *)malloc(sizeof(int)*n);
+
+    printf("Enter %d elements : ", n);
+    for(i=0; i<n; i++){
+        scanf("%d", &arr[i]);
+    }
+
+    printf("Enter a value to search = ");
+    scanf("%d", &search);
+
+    i = linear_search(arr, n, search);
+
+    if( i == -1 ){
+        printf("%d not found in array", search);
+    }
+    else{
+        printf("%d found at %d index", search, i);
+    }
+}
+```

day29/C/Binary_Search.c

@@ -0,0 +1,58 @@
+/*
+ * @author : ashwek
+ * @date : 29/01/2019
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+
+int binary_search(int *arr, int n, int search){
+
+    int low = 0, high = n-1;
+    int mid;
+
+    while( low <= high ){
+
+        mid  = (high - low) / 2 + low;
+
+        if( arr[mid] == search ){
+            return mid;
+        }
+        else if( search < arr[mid] ){
+            high--;
+        }
+        else{
+            low++;
+        }
+
+    }
+
+    return -1;
+}
+
+void main(){
+
+    int *arr, n, search, i;
+
+    printf("Enter size of array = ");
+    scanf("%d", &n);
+
+    arr = (int *)malloc(sizeof(int)*n);
+
+    printf("Enter %d elements (in sorted order) : ", n);
+    for(i=0; i<n; i++){
+        scanf("%d", &arr[i]);
+    }
+
+    printf("Enter a value to search = ");
+    scanf("%d", &search);
+
+    i = binary_search(arr, n, search);
+
+    if( i == -1 ){
+        printf("%d not found in array", search);
+    }
+    else{
+        printf("%d found at %d index", search, i);
+    }
+}

day29/README.md

@@ -45,6 +45,71 @@ console.log (binarySearch ([1, 2, 3, 4, 5, 8, 9], 8));
 console.log (binarySearch ([1, 2, 3, 4, 5, 8, 9], 7));
 ```
 
+### C Implementation
+
+## [Solution](./C/Binary_Search.c)
+
+```c
+/*
+ * @author : ashwek
+ * @date : 29/01/2019
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+
+int binary_search(int *arr, int n, int search){
+
+    int low = 0, high = n-1;
+    int mid;
+
+    while( low <= high ){
+
+        mid  = (high - low) / 2 + low;
+
+        if( arr[mid] == search ){
+            return mid;
+        }
+        else if( search < arr[mid] ){
+            high--;
+        }
+        else{
+            low++;
+        }
+
+    }
+
+    return -1;
+}
+
+void main(){
+
+    int *arr, n, search, i;
+
+    printf("Enter size of array = ");
+    scanf("%d", &n);
+
+    arr = (int *)malloc(sizeof(int)*n);
+
+    printf("Enter %d elements (in sorted order) : ", n);
+    for(i=0; i<n; i++){
+        scanf("%d", &arr[i]);
+    }
+
+    printf("Enter a value to search = ");
+    scanf("%d", &search);
+
+    i = binary_search(arr, n, search);
+
+    if( i == -1 ){
+        printf("%d not found in array", search);
+    }
+    else{
+        printf("%d found at %d index", search, i);
+    }
+}
+```
+
 ## Java Implementation
 
 ### [Solution](./Java/binarySearch.java)
@@ -151,4 +216,4 @@ int main(){
     cout << "Recursive: " << binary_search_rec(arr, 0, size-1, val) << endl;
     return 0;
 }
-```
+```