, Priyadarshani, Soubhik Chakarborty, Anch. “Parameterized Complexity of Quick Sort, Heap Sort and K-Sort Algorithms With Quasi Binomial Input”. International Journal on Future Revolution in Computer Science & Communication Engineering 4, no. 1 (January 31, 2018): 117–123. Accessed May 3, 2024. http://ijfrcsce.org/index.php/ijfrcsce/article/view/977.