Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Arrays;
- import junit.framework.TestCase;
- public class HeapsortTest extends TestCase {
- public void test_empty() {
- int[] elements = {};
- Heapsort.sort(elements);
- assertEquals(0, elements.length);
- }
- public void test_single_element() {
- int[] elements = {123};
- Heapsort.sort(elements);
- assertEquals(1, elements.length);
- assertEquals(123, elements[0]);
- }
- public void test_sorted_array() {
- int[] elements = {1, 2, 3};
- Heapsort.sort(elements);
- assertEquals(3, elements.length);
- assertTrue(Arrays.equals(elements, new int[]{1, 2, 3}));
- }
- public void test_simple() {
- int[] elements = {123, 20, 55, 40, 0};
- Heapsort.sort(elements);
- assertEquals(5, elements.length);
- assertTrue(Arrays.equals(elements, new int[]{0, 20, 40, 55, 123}));
- }
- public void test_same_elements() {
- int[] elements = {0,0,0,0,0};
- Heapsort.sort(elements);
- assertEquals(5, elements.length);
- assertTrue(Arrays.equals(elements, new int[]{0,0,0,0,0}));
- }
- }
Add Comment
Please, Sign In to add comment