Details

REDUCED ASSIGNMENT SORTING

by MORGAN, SPENCER

Abstract (Summary)
A new comparison-based sorting algorithm is presented that can reorder the elements in the fewest possible assignments (which is never greater than 3n/2), with a comparison complexity of O(nlogn)
Bibliographical Information:

Advisor:

School:University of Cincinnati

School Location:USA - Ohio

Source Type:Master's Thesis

Keywords:sort algorithm

ISBN:

Date of Publication:01/01/2007

© 2009 OpenThesis.org. All Rights Reserved.