1. Flores, I. (1960). Analysis of internal computer sorting. ACM, 7(4), 389–409.
2. Franceschini, G., & Geffert, V. (2003). An in-place sorting with O(n log n) comparisons and O(n) moves. In Proceedings of 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 242–250.
3. Knuth, D. (1998). The Art of Computer programming Sorting and Searching, 2nd edn. Addison-Wesley.
4. Oyelami Olufemi Moses. (2009). Improving the performance of bubble sort using a modified diminishing increment sorting. Scientific Research and Essay, 4(8), 740–744.
5. Rupesh, S., Tarun, T., & Sweetes, S. (2009). Bidirectional expansion—insertion algorithm for sorting. In Second International Conference on Emerging Trends in Engineering and Technology, ICETET-09.