1. An O(n log n) sorting network;Ajtai;Proc. 15th Ann. ACM Symp. on Theory of Computing,1983
2. An efficient variation of bubble sort;Dobosiewicz;Inform. Process. Lett.,1980
3. A study of the worst-case of Shellsort;Incerpi,1985
4. Improved upper bounds on Shellsort;Incerpi;Proc. 24th Ann. Symp. on Foundations of Computer Science,1983
5. The Art of Computer Programming;Knuth,1973