Description: C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and finally the remaining child is the winner. A few kids for victory
To Search:
File list (Check if you may need any files):
the four problem.c
the four problem.dsp
the four problem.dsw
the four problem.ncb
the four problem.opt
the four problem.plg
Download