Both the merge sort and the radix sort shown in FAQ III.2 (see Listings III.2b and III.2c for code) are good
sorting algorithms to use for linked lists.
Cross Reference:
III.1: What is the easiest sorting method to use?
III.2: What is the quickest sorting method to use?
III.3: How can I sort things that are too large to bring into memory?
sorting algorithms to use for linked lists.
Cross Reference:
III.1: What is the easiest sorting method to use?
III.2: What is the quickest sorting method to use?
III.3: How can I sort things that are too large to bring into memory?
No comments:
Post a Comment