diff --git a/Dynamic Programming/kadane_algorithm.cpp b/Dynamic Programming/kadane_algorithm.cpp
new file mode 100644
index 0000000..534bd2f
--- /dev/null
+++ b/Dynamic Programming/kadane_algorithm.cpp	
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <climits>
+using namespace std;
+int main(){
+    int N;
+    cin>>N;
+    vector<int> v(N);
+    for(int i=0;i<N;i++){
+        cin>>v[i];
+    }
+    int currSum = 0,finSum = INT_MIN;
+    for(int i=0;i<N;i++){
+        currSum += v[i];
+        currSum = max(currSum,0);
+        finSum = max(finSum,currSum);
+    }
+    //If the input contains all negative numbers, the sum of subarray will be zero, so return the max element among the negative numbers.
+    if(finSum==0){
+        cout<<*max_element(v.begin(),v.end())<<endl;
+    }else{
+        cout<<finSum<<endl;
+    }
+}
\ No newline at end of file
diff --git a/Search/BinarySearch/bsearch.cpp b/Search/BinarySearch/bsearch.cpp
index c1ea79d..fe0d265 100644
--- a/Search/BinarySearch/bsearch.cpp
+++ b/Search/BinarySearch/bsearch.cpp
@@ -13,9 +13,9 @@ bool binary_search(int number)
     int lower = 0;
     int mid;
 
-    do
+    while(lower < higher)
     {
-        mid = (higher + lower) / 2;
+        mid = lower + (higher - lower) / 2; //To avoid integer overflow when adding lower and higher
         if (number == myarray[mid])
         {
             std::cout << "found at pos: " << mid + 1 << std::endl;
@@ -29,7 +29,7 @@ bool binary_search(int number)
 
         if (higher - lower == 1)
             return false;
-    } while (true);
+    }
 }