Programming Project: Iterative List Merge Sort

Listing Three shows the implementation of this in Java 1.5.x within a linked list. Since the method does move nodes around, it is important that you correctly deal with the doubly-linked list. The head of the existing list is copied to a node that will be used to walk through that list. Then the initial list is transformed into a single-entry list. ................
................