Computer Science
Computer Science
bullet ‘Refuse to Sink’: Rowan to host consortium on suicide prevention | More

bullet Two Board of Trustees members return, three start first terms | More

bullet Sunday’s Rowan Open House cancelled | More

bullet Weather forecast won’t dampen Family Weekend fun at Rowan | More

bullet “The Little Star That Could” appears at Rowan Planetarium | More

Technical Report Number TR1996-2

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

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


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.