> Anyone know whether the cost of creating a Binomial Heap from an > unsorted set of arbitrary data size n can be reduced from O(n log n) > like that for a normal heap can? > (If this was covered in the lecture and I was asleep at the time or > something then sorry...) It can, it was, apology accepted. Peter ===== Peter Taylor pjt33@cam.ac.uk