• Priyadarshini
• Anchala Kumari

In this paper the parameterised complexity of three asymptotically optimal sorting algorithms, namely quick sort, k-sort and heap Sort(exhibiting same average case complexity O(Nlog2N)) has been examined , while subjecting these algorithms to randomly generated array from Binomial distribution where the probability of success (p) follows beta distribution with shape parameters (a=2,b=2). The complexity of these algorithms have further been compared with the parameterised complexity for binomial inputs with p following U(0,1).

Parameterized complexity, Beta distribution, Empirical-O analysis, Factorial Experiment.

"Parameterized Complexity Analysis of Heap sort, K-sort and Quick sort for Binomial Input with Varying Probability of Success", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 7, page no.491-495, July-2018, Available :http://www.jetir.org/papers/JETIR1807424.pdf

"Parameterized Complexity Analysis of Heap sort, K-sort and Quick sort for Binomial Input with Varying Probability of Success", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 7, page no. pp491-495, July-2018, Available at : http://www.jetir.org/papers/JETIR1807424.pdf