From 29f07f69fd5e65bb8fdfcafd0df096f1038c8d5d Mon Sep 17 00:00:00 2001
From: Shaunak Inamdar <65210567+ShaunakInamdar@users.noreply.github.com>
Date: Tue, 6 Oct 2020 14:54:28 +0530
Subject: [PATCH 1/2] added iterative binary search in C

---
 Binary Search/iterative binary search.c | 59 +++++++++++++++++++++++++
 1 file changed, 59 insertions(+)
 create mode 100644 Binary Search/iterative binary search.c

diff --git a/Binary Search/iterative binary search.c b/Binary Search/iterative binary search.c
new file mode 100644
index 0000000..876da37
--- /dev/null
+++ b/Binary Search/iterative binary search.c	
@@ -0,0 +1,59 @@
+#include <stdio.h>
+int iterative_binary(int array[], int start, int end, int search);
+int main()
+{
+    int array[50], n, i, s;
+    int idx;
+    printf("How many elements do you want to enter? ");
+    scanf("%d",&n);
+    
+    printf("Enter %d elements:\n",n);
+    for(i=0;i<n;i++)
+    {
+        scanf("\t%d",&array[i]);
+    }
+    
+    printf("Enter the element to search: ");
+    scanf("%d",&s);
+
+    idx = iterative_binary(array, 0, n-1, s);
+    if(idx == NULL)
+    {
+        printf("Element is not present in the array.\n");
+    }
+    else
+    {
+        printf("The element occurs in index: %d\n",idx);
+    }
+    return 0;
+}
+
+int iterative_binary(int array[], int start, int end, int search)
+{
+   while (start <= end)
+   {
+      int mid = start + (end - start)/2;
+      printf("Middle element: %d\n",mid);
+      if (array[mid] == search)
+         return mid;
+      if (array[mid] < search)
+         start = mid + 1;
+      else
+         end = mid - 1;
+   }
+   return;
+}
+
+
+
+
+
+
+
+
+
+
+
+
+
+

From 5c2f9145e7d6ef4dc93004b25ee886c32197b8e3 Mon Sep 17 00:00:00 2001
From: Shaunak Inamdar <65210567+ShaunakInamdar@users.noreply.github.com>
Date: Tue, 6 Oct 2020 15:00:23 +0530
Subject: [PATCH 2/2] added selection-sort.cpp

---
 Sorting/selection-sort.cpp | 45 ++++++++++++++++++++++++++++++++++++++
 1 file changed, 45 insertions(+)
 create mode 100644 Sorting/selection-sort.cpp

diff --git a/Sorting/selection-sort.cpp b/Sorting/selection-sort.cpp
new file mode 100644
index 0000000..18b7670
--- /dev/null
+++ b/Sorting/selection-sort.cpp
@@ -0,0 +1,45 @@
+#include<iostream>
+using namespace std;
+void swapping(int &a, int &b)
+{        
+   int temp;
+   temp = a;
+   a = b;
+   b = temp;
+}
+void display(int *array, int size) 
+{
+   for(int i = 0; i<size; i++)
+      cout << array[i] << " ";
+   cout << endl;
+}
+void selectionSort(int *array, int size) 
+{
+   int i, j, imin;
+   for(i = 0; i<size-1; i++)
+   {
+      imin = i;   //get index of minimum data
+      for(j = i+1; j<size; j++)
+         if(array[j] < array[imin])
+            imin = j;
+         //placing in correct position
+         swap(array[i], array[imin]);
+   }
+}
+int main() 
+{
+   int n;
+   cout << "Enter the number of elements: ";
+   cin >> n;
+   int arr[n];           
+   cout << "Enter elements:" << endl;
+   for(int i = 0; i<n; i++) 
+   {
+      cin >> arr[i];
+   }
+   cout << "Array before Sorting: ";
+   display(arr, n);
+   selectionSort(arr, n);
+   cout << "Array after Sorting: ";
+   display(arr, n);
+}