(a)

(b)

数组越界问题

(c)

n=0

(d)

点覆盖：[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]

边覆盖：[(1,2),(2,3),(3,4),(4,5),(5,6),(6,7),(7,5),(6,8),(8,9),(5,9),(9,10),(10,11),(11,2),(2,12),(12,13),(13,14),(14,15),(15,13),(13,16)]

主路径覆盖：

[1,2,3,4,5,6,7]

[1,2,3,4,5,9,10,11]

[1,2,3,4,5,9,11]

[1,2,3,4,5,6,8,9,10,11]

[1,2,3,4,5,6,8,9,11]

[1,2,12,13,14,15]

[1,2,12,13,16]

[2,3,4,5,6,8,9,10,11,2]

[2,3,4,5,6,8,9,11,2]

[2,3,4,5,9,10,11,2]

[2,3,4,5,9,11,2]

[3,4,5,6,8,9,10,11,2,12,13,14,15]

[3,4,5,6,8,9,10,11,2,12,13,16]

[3,4,5,6,8,9,11,2,12,13,14,15]

[3,4,5,6,8,9,11,2,12,13,16]

[3,4,5,9,10,11,2,12,13,14,15]

[3,4,5,9,11,2,12,13,14,15]

[3,4,5,9,10,11,2,12,13,16] 

[3,4,5,9,11,2,12,13,16]

[5,6,7,5]

[6,7,5,9,10,11,2,12,13,14,15]

[6,7,5,9,11,2,12,13,14,15]

[6,7,5,9,10,11,2,12,13,16]

[6,7,5,9,11,2,12,13,16]

[13,14,15,13]

[14,15,13,16]

测试代码：

import static org.junit.Assert.*;

import org.junit.Test;

import static org.junit.Assert.*;

import org.junit.Test;

public class TestPrimes {

    @Test

    public void testPrintPrimes() {

        printPrimes pp = new printPrimes();

        pp.printPrimes(10);

    }

}

【SoftwareTesting】Homework3