List processing: sort again, naturally

  • Authors:
  • Timothy J. Rolfe

  • Affiliations:
  • Eastern Washington University, Cheney, Washington

  • Venue:
  • ACM SIGCSE Bulletin
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper discusses a possible student project for use within the Data Structures and Algorithms treatment of linked lists. Students can explicitly compare the recursive list-oriented MergeSort algorithm with iterative list-oriented MergeSort algorithms (with O(n) space overhead) including the "Natural MergeSort." The author's experimental results are shown for implementations in C and in Java.