Affiliation:
1. Worcester Polytechnic Institute, Worcester, MA
Abstract
We show how to find optimal algorithms for the selection of one or more order statistics over a small set of numbers, and as an extreme case, complete sorting. The criterion is using the smallest number of comparisons; separate derivations are performed for minimization on the average (over all permutations) or in the worst case. When the computational process establishes the optimal values, it also generates C-language functions that implement policies which achieve those optimal values. The search for the algorithms is driven by a Markov decision process, and the program provides the optimality proof as well.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science
Reference14 articles.
1. Bellman R. 1957. Dynamic Programming. Princeton University Press. (The 1972 6th printing of the book was reissued in 2003 by Dover Publications). Bellman R. 1957. Dynamic Programming. Princeton University Press. (The 1972 6 th printing of the book was reissued in 2003 by Dover Publications).
2. Cantone D. and Hofri M. 2013. Further analysis of the remedian algorithm. Theor. Comput. Sci. (to appear). 10.1016/j.tcs.2013.05.039 Cantone D. and Hofri M. 2013. Further analysis of the remedian algorithm. Theor. Comput. Sci. (to appear). 10.1016/j.tcs.2013.05.039
3. Transitional behaviors of the average cost of quicksort with median-of-(2t + 1)
4. Omtet L. 1974. Advanced Combinatorics. D. Reidel Publishing. Omtet L. 1974. Advanced Combinatorics. D. Reidel Publishing.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献