GFG Recursion solution for joseph

 package com.company;

public class CWR_Gfg_JosephusProblem {
//    Josephus problem
    public static int jos(int n, int k){
        if(n == 1){
            return 0;
        }

        return (jos(n-1, k) + k) % n;
    }
    public static int myJos(int n, int k){
        int a = jos(n, k) + 1;
        return a;
    }
    public static void main(String[] args) {
        System.out.println(myJos(5,3));

    }
}