Computer Science
Computer Science
bullet Books and supplies in hand, Rowan education students to assist children in India | More

bullet Rowan bio professor helps trace evolution of horses, more via fossils | More

bullet A holiday benefit with Frankie Avalon...and friends | More

bullet Joanne Connor named WPN institutional representative | More

bullet B-TV: NYC art show celebrates David Bianculli’s love of television | More

Technical Report Number TR1996-2

Title
An Empirical Comparison of the Data Locality of Eight Internal Sorting Algorithms

Author
Seth Bergmann
Department of Computer Science
Rowan College of New Jersey
Glassboro, NJ 08028

Abstract

Seven well known internal sorting algorithms are compared, using an empirical method, with respect to locality of data references for both worst case and average case inputs. A modification of the heap data structure exhibiting improved performance is introduced and compared with the other algorithms.