import java.io.*; import java.util.*; /** * This program takes in a file with integers and sorts it with heapsort */ public class HeapSort { /** * main method */ public static void main (String[] args) { if( args.length != 1) { System.err.println("Usage: java HeapSort filename"); System.exit(0); } else { Scanner input=null; Integer[] items; int[] elements; Integer[] emptyHeap; ArrayList list = new ArrayList(); try { input = new Scanner(new File(args[0])); } catch(FileNotFoundException fnf) { System.err.println(fnf); } while(input.hasNext()) { list.add(input.nextInt()); } input.close(); items = new Integer[list.size()]; list.toArray(items); elements = new int[list.size()-1]; for (int i =0; i<=elements.length-1; i++ ) { elements[i] = items[i+1].intValue(); } System.out.println(list.size()); emptyHeap = new Integer[list.size()-1]; //create heap object TernaryHeap blah = new TernaryHeap(emptyHeap) ; for(int i=0; i<=elements.length-1; i++) { blah.insert(elements[i]); } try { blah.remove(); } catch( UnderflowException ufe) { System.err.println(ufe); } System.out.print(blah.toString()); } } } //HeapSort