Quoted
[...] auf welchen die Testfälle [...] über Nacht angewendet werden sollen.
This post has been edited 1 times, last edit by "matthiass" (May 29th 2011, 4:05pm)
This post has been edited 1 times, last edit by "derhaase" (May 29th 2011, 7:01pm)
Java source code |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 |
public class Converter { /** * Konvertiert eine Dezimalzahl in eine römische Zahl. Es werden nur * Tausender- und Hunderteranteile konvertiert. * */ public static String decimalToRoman(int n) { String romanNumber = ""; if (n <= 0) { romanNumber = "Keine römische Zahl"; } else { int thousands = n / 1000; n %= 1000; for (int i = 0; i < thousands; i++) { romanNumber += "M"; } if (n >= 900) { romanNumber += "CM"; } else { if (n >= 500) { romanNumber += "D"; int hundreds = (n - 500) / 100; for (int i = 0; i < hundreds; i++) { romanNumber += "C"; } } else { if (n >= 400) { romanNumber += "CD"; } else { if (n >= 100) { int hundreds = n / 100; for (int i = 0; i < hundreds; i++) { romanNumber += "C"; } } } } } } return romanNumber; } } |
Es geht also darum eine Basis von linear unabhängigen Pfaden zu finden und zu testen.Quoted
One testing strategy, called Basis Path Testing by McCabe who first proposed it, is to test each linearly independent path through the program; in this case, the number of test cases will equal the cyclomatic complexity of the program