Date of Defense
6-1983
Department
Computer Science
Abstract
Over 25% of all computing time is spent on sorting information [4]. Some timesharing installations spend over 50% of all computing time sorting information. Since such a significant portion of all computing time is devoted to sorting information, the development of new sorting techniques must reflect the need for efficient use of computing resources and economic use of available space. This document describes the various types of sorting techniques and focuses on research with one type of sorting technique known as QUICKSORT.
Recommended Citation
Peeler, Edward J., "Variations on a Theme: New Quicksort Algorithms" (1983). Honors Theses. 1537.
https://scholarworks.wmich.edu/honors_theses/1537
Access Setting
Honors Thesis-Campus Only