Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

REDUCED ASSIGNMENT SORTING

MORGAN, SPENCER

Abstract Details

2007, MS, University of Cincinnati, Engineering : Computer Science.
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)
Dr. John Franco (Advisor)
238 p.

Recommended Citations

Citations

  • MORGAN, S. (2007). REDUCED ASSIGNMENT SORTING [Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1193433415

    APA Style (7th edition)

  • MORGAN, SPENCER. REDUCED ASSIGNMENT SORTING. 2007. University of Cincinnati, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1193433415.

    MLA Style (8th edition)

  • MORGAN, SPENCER. "REDUCED ASSIGNMENT SORTING." Master's thesis, University of Cincinnati, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1193433415

    Chicago Manual of Style (17th edition)