Add files via upload

Author: ahmedalycess

BinarySearch.c

@@ -0,0 +1,61 @@
+#include "BinarySearch.h"
+
+uint8_t binarySearch(uint32_t *arr, uint8_t size,uint32_t number){
+    // check whether the array is sorted or not
+    if(!sorted(arr, size))
+        //if the array is not sorted it will be sorted
+        sort(arr, size);
+    //initializing the start, mid, and end of the array
+    uint32_t start = 0, mid = size/2, end = size;
+    // searching for the number given
+    while (1){
+        // if the number is located in the index mid, the index will be returned
+        if(number == arr[mid]){
+            return mid;
+        } else if (start == mid){           //checking if the search has reached the end or not
+            return -1;                      // if the start = mid --> indicates that search ended
+        }
+        // if the number is smaller or bigger than the number in the index of mid, modify the values of start, mid, and end.
+        else if (number <arr[mid]){
+            end = mid -1;
+            mid = (start + end)/2 ;
+            continue;
+        } else if (number > arr[mid]){
+            start = mid +1;
+            mid = (start + end)/2 ;
+            continue;
+        }
+    }
+}
+// function to check whether the array is sorted or not
+uint8_t sorted (const uint32_t *arr, uint8_t size){
+    for(int i = 0; i<size-1; i++){
+       if(arr[i] > arr[i+1]) return 0;
+    }
+    return 1;
+}
+// sorting the array if not sorted using bubble sort algorithm
+void sort(uint32_t *arr, uint8_t size){
+    /*using nested loops to take each element and
+      compare it to the rest of the elements in the array */
+    for (int i = 0; i < size-1; i++)
+        for (int j = 0; j < size-i-1; j++)
+            if (arr[j] > arr[j+1])
+                // using the swap function if the element is greater than the element after it
+                swap(&arr[j], &arr[j+1]);
+}
+// swap function to swap elements
+void swap(uint32_t *num1, uint32_t *num2)
+{
+    int temp = *num1;
+    *num1 = *num2;
+    *num2 = temp;
+}
+// function used to print the array
+void printArray(uint32_t *arr, uint32_t size){
+    printf("{");
+    for(int i = 0; i< size-1; i++)
+        printf("%d,", arr[i]);
+
+    printf("%d}\n", arr[size-1]);
+}

BinarySearch.h

@@ -0,0 +1,16 @@
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+
+typedef signed char uint8_t;
+typedef unsigned int uint32_t;
+
+extern uint8_t binarySearch(uint32_t *arr, uint8_t size,uint32_t number);
+
+extern uint8_t sorted (const uint32_t *arr, uint8_t size);
+
+extern void sort(uint32_t *arr, uint8_t size);
+
+extern void swap(uint32_t *num1, uint32_t *num2);
+
+extern void printArray(uint32_t *arr, uint32_t size);

main.c

@@ -0,0 +1,70 @@
+#include "BinarySearch.h"
+
+uint8_t arrSize(const uint32_t *arr);
+int main() {
+    // initialize the program
+    printf("\t\tWelcome\n");
+    printf("Press 's' to start the program\n");
+    char input= ' ';
+    scanf(" %c", &input);
+    // if the user wants to start the program he will press 's'
+    if(input == 's') {
+        // changing the input to 'r' -> reload, to reload the program if wanted after ending it
+        input = 'r';
+        while (input == 'r') {
+            // options given to the user
+            printf("Options: \n");
+            printf("a)Search for an index of a number in the array (after automatically sorted if needed)\n"
+                   "b)Array before sort\n"
+                   "c)Array after sorted\n");
+            scanf(" %c", &input);
+            // initializing array of uint32_t
+            uint32_t arr[256] = {19, 10, 8, 17, 9, 12, 14, 26, 20, 24, 29, 31, 7, 40, 35};
+            // determining the size of the array
+            uint8_t size = arrSize(arr);
+            // number that he user will search for its index in the array later
+            uint32_t number = 0;
+            // checking the user input
+                switch (input) {
+                    case 'b':
+                        printf("Array before sort = ");
+                        printArray(arr, size);
+                        break;
+                    case 'c':
+                        // sort the array and print it
+                        sort(arr, size);
+                        printf("Array after sort = ");
+                        printArray(arr, size);
+                        break;
+
+                    case 'a':
+                        printf("Please enter a number to search for\n");
+                        scanf(" %d", &number);
+                        //passing the array to our function and storing the returned value in result
+                        uint32_t result = binarySearch(arr, size, number);
+                        // showing the result to the user
+                        if (result == (-1)) {
+                            printf("Number is not found in the array\n");
+                        } else {
+                            printf("Number found in index %d"
+                                   "\n", result);
+                        }
+                        break;
+                    default:
+                        printf("Invalid input!\n");
+                        break;
+                }
+
+            // checking whether the user wants to reload the program or not
+            printf("Press 'r' to reload or any other key to exit\n");
+            scanf(" %c", &input);
+        }
+    }
+    return 0;
+}
+//function used to determine the size of the array
+uint8_t arrSize(const uint32_t *arr) {
+    int i = 0;
+    while(arr[i] != '\0') i++;
+    return i;
+}