From 4cbd5f64651ec834e5fb1ea0132cff56ad8951b8 Mon Sep 17 00:00:00 2001
From: Hub-Abhi <62337400+Hub-Abhi@users.noreply.github.com>
Date: Thu, 1 Oct 2020 22:48:34 +0530
Subject: [PATCH 1/2] Update Sort1.c

---
 Sort1.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Sort1.c b/Sort1.c
index 5de260b..fea1c06 100644
--- a/Sort1.c
+++ b/Sort1.c
@@ -47,7 +47,7 @@ int main()
     for(i=0;i<n;i++)
      scanf("%d",arr+i);
     insertionSort(arr, n);
-     printf("\nThe array elements:\n");
+     printf("\nThe array elements are:\n");
     printArray(arr, n);
     int result = binarySearch(arr, 0, n - 1);
     printf("\nElement 1 is first present at index %d and at position %d.\n",result,result+1);

From 0b83588fac0d04ef817b9576f5a603fb2c1b0db9 Mon Sep 17 00:00:00 2001
From: Hub-Abhi <62337400+Hub-Abhi@users.noreply.github.com>
Date: Thu, 1 Oct 2020 23:06:03 +0530
Subject: [PATCH 2/2] Update Sort1.c

---
 Sort1.c | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Sort1.c b/Sort1.c
index fea1c06..9bc8ae0 100644
--- a/Sort1.c
+++ b/Sort1.c
@@ -24,18 +24,18 @@ int binarySearch(int *arr, int l, int r)
      	{ 
        		 int mid= (l + r)/2;
        		 if (*(arr+mid)==1 && *(arr+mid-1)==0)  
-           		 return mid; 
+           		   return mid; 
 		 else if(*(arr+mid)==0 && *(arr+mid+1)==1)
            		   return (mid+1);
        		 else if (*(arr+mid)==1 && *(arr+mid-1)==1) 
-        			    return binarySearch(arr, l, mid-1); 
+        		   return binarySearch(arr, l, mid-1); 
     	}
 } 
 void printArray(int *arr, int n) 
 { 
     for(int i=0;i<n;i++)
      printf("%d ",*(arr+i));
-    printf("\n");
+     printf("\n");
 } 
 int main() 
 { 
@@ -45,9 +45,9 @@ int main()
     arr=(int*)malloc(n*sizeof(int));
     printf("\nEnter the binary array elements: ");
     for(i=0;i<n;i++)
-     scanf("%d",arr+i);
+    scanf("%d",arr+i);
     insertionSort(arr, n);
-     printf("\nThe array elements are:\n");
+    printf("\nThe array elements are:\n");
     printArray(arr, n);
     int result = binarySearch(arr, 0, n - 1);
     printf("\nElement 1 is first present at index %d and at position %d.\n",result,result+1);