Description: Joseph problems with n solution of two individuals sitting around in a round-table, starting with the first s individuals started off, a few individuals out to the first m out, and then a column from the next person to start off, a few to the first m another person out ... so ... repeat until all of the people out so far. This procedure, respectively, with chain storage structure (circular list), and the order of the storage structure (array) to resolve the issue of Joseph, for beginners to identify both the similarities and differences between storage structure user input: n, s, m (comma separated) output : out out the order form
- [T3] - Josephus : No. 1, 2, 3, ..., n n clockwi
- [problemisachieved.Rar] - [n-- with the individuals sitting around
- [JOPHLINK] - data structure Josephus the chain storag
- [EvaluateExpression] - Expression evaluated by the usual habits
- [pd064vt5] - Prepared using VHDL lcd controller, have
- [change] - Prepared using 51 Singlechip shi hexadec
- [11] - Joseph (Joeph) problem, using one-way li
- [GA-TSP] - The use of genetic algorithm to solve TS
- [44jianpan] - 4 × 4 matrix keyboard key LCD1602 displa
- [1] - Known to increase the value ordered by t
File list (Check if you may need any files):
Download