References

2-1. Betz, B. K. and Carter, ACM National Conf., 14, (1959), Paper 14.

2-3. GiLsTAD, R. L., “Polyphase Merge Sorting—An Advanced Technique,”

2-4. Hoare, C. A. R., “Proof of a Program: FIND,” Comm. ACM, 13, No. 1

2-5. , “Proof of a Recursive Program: Quicksort,” Comp. J., 14, No. 4

2-7. Knutu, D.E., The Art of Computer Programming, Vol. 3 (Reading, Mass.:

2-9. , The Art of Computer Programming, 3, p. 289.

2-10. Lorin, H., “A Guided Bibliography to Sorting,” IBM Syst. J., 10, No. 3

2-11. SHELL, D. L., “A Highspeed Sorting Procedure,” Comm. ACM, 2, No. 7

2-12. SINGLETON, R. C., “An Efficient Algorithm for Sorting with Minimal

2-13. VAN EMDEN, M. H., “Increasing the Efficiency of Quicksort” (Algorithm