package heapSort;

import junit.framework.TestCase;

public class HeapSortTest extends TestCase {

	public void testSwap() {
		// fail("Not yet implemented");
	}

	public void testGetParent() {
		// fail("Not yet implemented");
	}

	public void testGetLeftChild() {
		// fail("Not yet implemented");
	}

	public void testGetRightChild() {
		// fail("Not yet implemented");
	}

	public void testIsLeaf() {
		// fail("Not yet implemented");
	}

	public void testHasRightChild() {
		// fail("Not yet implemented");
	}

	public void testIsRoot() {
		// fail("Not yet implemented");
	}

	public void testHeapInsert() {
		// fail("Not yet implemented");
	}

	public void testHeapify() {
		// fail("Not yet implemented");
	}

	public void testDeleteRoot() {
		// fail("Not yet implemented");
	}

	public void testHeapSort() {
		String[] a = {"bear", "dog", "fish", "earwig",
			      "ant", "goat", "hyena", "cow"};
		HeapSort.heapSort(a);
		for (int i = 0; i < a.length; i++)
			System.out.println(a[i]);
	}

}