American Psychological Association 6th edition

Sundaramoorthy, S., & Karunanidhi, G. (2025). A systematic analysis on performance and computational complexity of sorting algorithms. Discover Computing, 28(1). https://doi.org/10.1007/s10791-025-09724-w

ISO-690 (author-date, English)

SUNDARAMOORTHY, Sureshkumar and KARUNANIDHI, Govardhan, 2025. A systematic analysis on performance and computational complexity of sorting algorithms. Discover Computing. 1 December 2025. Vol. 28, no. 1, . DOI 10.1007/s10791-025-09724-w.

Modern Language Association 9th edition

Sundaramoorthy, S., and G. Karunanidhi. “A Systematic Analysis on Performance and Computational Complexity of Sorting Algorithms”. Discover Computing, vol. 28, no. 1, Dec. 2025, https://doi.org/10.1007/s10791-025-09724-w.

Mohr Siebeck - Recht (Deutsch - Österreich)

Sundaramoorthy, Sureshkumar/Karunanidhi, Govardhan: A systematic analysis on performance and computational complexity of sorting algorithms, Discover Computing 2025,

Emerald - Harvard

Sundaramoorthy, S. and Karunanidhi, G. (2025), “A systematic analysis on performance and computational complexity of sorting algorithms”, Discover Computing, Vol. 28 No. 1, available at:https://doi.org/10.1007/s10791-025-09724-w.

Warning: These citations may not always be 100% accurate.