josephuspermutationtests.java

来自「<算法导论>第二版大部分算法实现. 1. 各类排序和顺序统计学相关」· Java 代码 · 共 41 行

/*
 * Copyright (C) 2003-2008 Wang Pengcheng <[e-mail]>
 * Permission is granted to copy, distribute and/or modify this
 * document under the terms of the GNU Free Documentation License,
 * Version 2.0 or any later version published by the Free Software Foundation;
 * with no Invariant Sections.
 * You may obtain a copy of the License at
 *   http://www.gnu.org/licenses/lgpl.txt
 */
//12 Mar 2008
package cn.edu.whu.iss.algorithm.unit14.test;

import cn.edu.whu.iss.algorithm.unit14.JosephusPermutation;
import junit.framework.TestCase;
public class JosephusPermutationTests extends TestCase implements JosephusPermutationTestData{

	JosephusPermutation j;
	
	protected void setUp() throws Exception {
		super.setUp();
		j = new JosephusPermutation();
	}

	public void testGetResIntInt() {
		for(int i=0;i<ANS.length;i++){
			String res = j.getRes(M[i], N[i]);
			//System.out.println("The i is "+i);
			//System.out.println(res);
			assertEquals(Josephus.getRes(M[i], N[i]), res);
		}
		for(int i=1000;i<1003;i++){
			for(int k=2;k<=i;k++){
				System.out.println(i+","+k);
				String res = j.getRes(k,i);
				assertEquals(Josephus.getRes(k, i), res);
			}
		}
	}

}