diff --git a/Algorithms/Greatest_common_divisor_Algo.cpp b/Algorithms/Greatest_common_divisor_Algo.cpp
new file mode 100644
index 0000000..bb2eb95
--- /dev/null
+++ b/Algorithms/Greatest_common_divisor_Algo.cpp
@@ -0,0 +1,22 @@
+// Greatest Common Divisor Algorithm in recursive approach
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int gcd(int firstNum, int secondNum) {
+	// firstNum%secondNum = secondNum;
+	// when secondNum divides completely to the firstNum 
+	// firstNum%secondNum = remainder 
+	if(firstNum%secondNum==0){
+		return secondNum;
+	}
+    return gcd(secondNum,firstNum%secondNum);
+}
+
+int main(){
+  int firstnum , secondnum;
+  cin>>firstnum>>secondnum;
+  cout<<gcd(firstnum,secondnum);
+  
+  return 0;
+}
diff --git a/Algorithms/kadane's_algorithm.cpp b/Algorithms/kadane's_algorithm.cpp
new file mode 100644
index 0000000..80903ac
--- /dev/null
+++ b/Algorithms/kadane's_algorithm.cpp
@@ -0,0 +1,35 @@
+
+// kadane's algorithm
+
+#include <bits/stdc++.h>
+using namespace std;
+
+int max_array_sum(int ar[],int a){
+    
+    int till_cur_sum=0 , total_sum=INT_MIN , max_element=INT_MIN;
+        for(int j=0;j<a;j++){
+            till_cur_sum = till_cur_sum + ar[j];
+            total_sum = max(till_cur_sum,total_sum);
+          //  max_element= max(max_element,ar[j]);
+            if(till_cur_sum<0){
+                till_cur_sum=0;
+            }
+        }
+        if(total_sum==0){
+          total_sum = max_element;
+        } 
+     return total_sum;
+}
+
+int main(){
+    int n;
+    cin>>n;
+    int arr[n];
+    
+    for(int i=0;i<n;i++){
+        cin>>arr[i];
+    }
+    cout<<" Maximum subarray sum : "<< max_array_sum(arr,n);
+    
+    return 0;
+}