diff --git a/MaxSubarray.cpp b/MaxSubarray.cpp
new file mode 100644
index 0000000..0280476
--- /dev/null
+++ b/MaxSubarray.cpp
@@ -0,0 +1,27 @@
+#include <iostream>
+using namespace std;
+
+// function for kadane's algorithm
+static int kadane(int Array[], int n) {
+  int max_sum = 0;
+  int current_sum = 0;
+
+  for(int i=0; i<n; i++) {
+    current_sum = current_sum + Array[i];
+    
+    if (current_sum < 0)
+      current_sum = 0;
+    
+    if(max_sum < current_sum)
+      max_sum = current_sum;
+  }
+  return max_sum;
+}
+
+// test the code
+int main() {
+  int MyArray[] = {-3, 1, -8, 12, 0, -3, 5, -9, 4};
+  int n = sizeof(MyArray) / sizeof(MyArray[0]);
+  cout<<"Maximum SubArray is: "<<kadane(MyArray, n);
+  return 0;
+}
\ No newline at end of file
diff --git a/README.md b/README.md
new file mode 100644
index 0000000..8ef8fe6
--- /dev/null
+++ b/README.md
@@ -0,0 +1 @@
+# Programming_Hactoberfest23