Algorithm Sedgewick Fourth Edition-1th chapter BASIC-171 Joseph Question

1 /*************************************************************************2  * 3 * Josephus Problem4  *  5 *% java ex_1_3_37 7 26 * 1 3 5 0 4 2 67  *  8  *************************************************************************/9 Ten  Public classex_1_3_37 One { A      Public Static voidMain (string[] args) -     { -         intn = integer.parseint (args[0]), them = Integer.parseint (args[1]); -          -queue<integer> q =NewQueue<integer>(); -          for(inti = 0; I < n; i++) +Q.enqueue (NewInteger (i)); -          +         intK = 0; A          while(!q.isempty ()) at         { -             intx =q.dequeue (); -              -             if(++k% m = = 0) -Stdout.print (x + ""); -             Else in q.enqueue (x); -         } to stdout.println (); +     } -}

Algorithm Sedgewick Fourth Edition-1th chapter BASIC-171 Joseph Question