Create Josephusproblem

Josephusproblem

@@ -0,0 +1,35 @@
+#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; 
+				// josephus problem
+	int k = 2;
+	k--; // (k-1)th person will be killed
+	int index
+		= 0; // The index where the person which will die
+
+	vector<int> person;
+	// fill the person vector
+	for (int i = 1; i <= n; i++) {
+		person.push_back(i);
+	}
+
+	Josh(person, k, index);
+}