54 lines
1.1 KiB
Java
54 lines
1.1 KiB
Java
import static org.junit.Assert.*;
|
|
import org.junit.Test;
|
|
import java.util.*;
|
|
|
|
/** Test class.
|
|
* @author Jaanus
|
|
*/
|
|
public class IntSortingTest {
|
|
|
|
int[] a, b;
|
|
String msg = "";
|
|
|
|
/**
|
|
* Check whether an array is ordered.
|
|
*
|
|
* @param a
|
|
* sorted (?) array
|
|
* @return false
|
|
* if an array is not ordered
|
|
*/
|
|
static boolean inOrder(int[] a) {
|
|
if (a.length < 2)
|
|
return true;
|
|
for (int i = 0; i < a.length - 1; i++) {
|
|
if (a[i] > a[i + 1])
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
@Test (timeout=1000)
|
|
public void testTrivialArray() {
|
|
a = new int[] {1, 3, 2};
|
|
b = new int[] {1, 2, 3};
|
|
msg = Arrays.toString(a);
|
|
IntSorting.binaryInsertionSort (a);
|
|
assertArrayEquals (msg, b, a);
|
|
}
|
|
|
|
@Test (timeout=1000)
|
|
public void testRandom1000() {
|
|
int[] a = new int[1000];
|
|
Random generaator = new Random();
|
|
for (int i = 0; i < a.length; i++) {
|
|
a[i] = generaator.nextInt (100);
|
|
}
|
|
IntSorting.binaryInsertionSort (a);
|
|
msg = " array not sorted!";
|
|
assertTrue (msg, inOrder (a));
|
|
}
|
|
|
|
}
|
|
|