http://en.wikipedia.org/wiki/Insertion_sort
HW Goal: eventually is a specific implementation of a Huffman encoding.
we got frequency array
#2.2 Priority Queue
push operation to put an element into the queue
pop operation to return the *smallest* element in the priority queue
internal representation, at this point, up to you. priority queue of ints
how to fill a byte array from a file
http://www.exampledepot.com/egs/java.io/file2bytearray.html
when is HW 2.2 due?
ReplyDeletewednesday night
ReplyDeleteDo you want us to implement it into the frequency array program, or use the QueueClass that we created in 1.4? I was just wondering because you use the term Queue..
ReplyDeleteseparate from both of these. yes, it is a type of Queue, so it might be a good thing to implement the Queue interface when writing this new class.
ReplyDelete*eventually*, both the frequency array program and this PriorityQueue class will join together to form an interesting larger program.