We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
ON THE ROBUSTNESS OF K-SORT AND ITS COMPARISON TO QUICK SORT IN AVERAGE CASE.
- Authors
Pal, Mita; Cakraborty, Soubik
- Abstract
The present paper examines the robustness of the average case O (nlogn) complexity on K-sort, a new version of quick sort. In our first study we reconfirm this through computer experiments. A computer experiment is a series of runs of a code for various inputs. A deterministic computer experiment is one which produces identical results if the code is re-run for identical inputs. Our second study reveals that K-sort is the better choice for discrete uniform distribution U(l, 2, ..., k) inputs whereas quick sort is found better for continuous uniform distribution U(0,1) inputs. Interestingly, increasing k which decreases the ties is good for quick sort but bad for K-sort.
- Subjects
ROBUST control; CAUCHY integrals; MATHEMATICAL complex analysis; DISCRETE uniform distribution; MATHEMATICAL models; NUMERICAL analysis
- Publication
Annals. Computer Science Series, 2012, Vol 10, Issue 1, p99
- ISSN
1583-7165
- Publication type
Article