From 94bee139ee518a6ab1a3766e2e3ba5de7f9ecd8b Mon Sep 17 00:00:00 2001
From: Gladwin Joseph Solomon B <gladwin1508@gmail.com>
Date: Thu, 23 Jun 2022 18:37:29 +0530
Subject: [PATCH 1/2] Update 06 sparse_search.cpp

little efficient code
---
 04 Sorting & Searching/06 sparse_search.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/04 Sorting & Searching/06 sparse_search.cpp b/04 Sorting & Searching/06 sparse_search.cpp
index c023710..f948a67 100644
--- a/04 Sorting & Searching/06 sparse_search.cpp	
+++ b/04 Sorting & Searching/06 sparse_search.cpp	
@@ -9,9 +9,9 @@ int sparse_search(string a[],int n,string key){
     int e = n-1;
     while(s<=e){
         int mid = (s+e)/2;
-        int mid_left = mid - 1;
-        int mid_right = mid + 1;
         if(a[mid]==""){
+            int mid_left = mid - 1;
+            int mid_right = mid + 1;
             while(1){
                 if(mid_left<s and mid_right>e){
                     return -1;

From 39a667c15cd368aa8e600b90efbe2491b709fba3 Mon Sep 17 00:00:00 2001
From: Gladwin Joseph Solomon B <gladwin1508@gmail.com>
Date: Thu, 23 Jun 2022 23:57:05 +0530
Subject: [PATCH 2/2] Update kpartition.cpp

Reduce search space
---
 05 Binary Search/kpartition.cpp | 1 +
 1 file changed, 1 insertion(+)

diff --git a/05 Binary Search/kpartition.cpp b/05 Binary Search/kpartition.cpp
index 51c0368..47a661f 100644
--- a/05 Binary Search/kpartition.cpp	
+++ b/05 Binary Search/kpartition.cpp	
@@ -27,6 +27,7 @@ int k_partition(int arr[],int n,int k){
     for(int i=0;i<n;i++){
         e += arr[i];
     }
+    e=e/k;
     //mid
     int mid;
     int ans;