(no subject)
For the next phase of my Data Structures project, I need to implement one of several different "pointer-based" heaps -- a leftist heap, a skew heap, a binomial queue, etc. I'm torn between writing a skew/leftist heap (which would be dead easy, but not very interesting) and writing a binomial queue, which would be darned nifty but also a pain in the ass to write in Java. (I think I could do it pretty damn easily in SML....)
Of course, I do need to come up with some sample Java code for a potential internship, so maybe I *should* do the niftier thing and then use that as my sample...
Of course, I do need to come up with some sample Java code for a potential internship, so maybe I *should* do the niftier thing and then use that as my sample...