| |
Summary/Review | page 6 of 7 |
In Lesson 25, you developed a recursive merge sort algorithm using arrays. An unordered linked list is difficult to sort given its sequential nature, but a recursive merge sort can be developed for linked lists using the LinkedList class. The algorithms required (split and merge) will provide excellent practice in working with the LinkedList , Iterator , and ListIterator classes. After applying a recursive merge sort to a linked list, another function to reverse the list will be written.
|