Engineering quicksort

Computer Languages - Tập 22 - Trang 39-47 - 1996
S.Mansoor Sarwar1, Syed Aqeel Sarwar2, Mansour H.A. Jaragh3, Jesse Brandeburg1
1Department of Electrical Engineering, Multnomah School of Engineering, University of Portland, 5000 N. Willamette Blvd, Portland, OR 97203-5798, U.S.A.
2Academic Computing Laboratories, New York Institute of Technology, Harry Schure Hall. Old Westbury, N.Y. 11568, U.S.A.
3Department of Electrical and Computer Engineering, Faculty of Engineering and Petroleum, Kuwait University, P.O. Box 5969, 13060 Safat, Kuwait

Tài liệu tham khảo

Hoare, 1962, Quicksort, Comput. J., 5, 10, 10.1093/comjnl/5.1.10 Knuth, 1973 Nievergelt, 1993 Aho, 1983 Sedgewick, 1988 Weiss, 1993 Bentley Jon, 1993, Douglas. Engineering a sort function, Software: Prac. Exper., 23, 1249, 10.1002/spe.4380231105 Sarwar, 1994, An empirical study of the run-time behavior of Quicksort Shellsort, and Mergesort for medium to large size data, Comput. Lang., 20, 127, 10.1016/0096-0551(94)90019-1 Weiss, 1991, Empirical study of the expected running time of Shellsort, Comput. J., 34, 88, 10.1093/comjnl/34.1.88 Weiss, 1990, More on Shellsort increment sequences, Inform. Process. Lett., 34, 267, 10.1016/0020-0190(90)90134-J Sedgewick, 1978, Implementing Quicksort programs, CACM, 21, 847, 10.1145/359619.359631 Sedgewick, 1977, The analysis of Quicksort programs, Acta Inform., 7, 327, 10.1007/BF00289467
Thông tin
Thông tin xuất bản

Computer Languages

Tập 22

39-47

Thông tin tác giả