Merge pull request #325 from alex-2003-47/main

Added Josephus Problem on recursion.

Author: gantavyamalviya

CPP/recursion/JosephusProblem.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+void Josh(vector<int> person, int k, int index)
+{
+	if (person.size() == 1) {
+		cout << person[0] << endl;
+		return;
+	}
+	index = ((index + k) % person.size());
+	person.erase(person.begin() + index);
+	Josh(person, k, index);
+}
+
+int main()
+{
+	int n = 14;
+	int k = 2;
+	k--;
+	int index= 0;
+	vector<int> person;
+	for (int i = 1; i <= n; i++) {
+		person.push_back(i);
+	}
+	Josh(person, k, index);
+}

Java/Array/Kadane_Algorithm.java

@@ -0,0 +1,18 @@
+import java.util.*;
+public class KadaneAlgo {
+    public static void main(String[] args) {
+        Scanner sc= new Scanner(System.in);
+        int i,sum=0,maxsum=0,n=sc.nextInt();
+        int[] a=new int[n];
+        for(i=0;i<n;i++)
+        {
+            a[i]=sc.nextInt();
+            sum=sum+a[i];
+            if(sum>maxsum)
+                maxsum=sum;
+            if(sum<0)
+                sum=0;
+        }
+        System.out.println(maxsum);
+    }
+}