, P. S. C. A. 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, [S. l.], v. 4, n. 1, p. 117–123, 2018. Disponível em: http://ijfrcsce.org/index.php/ijfrcsce/article/view/977. Acesso em: 3 may. 2024.