Parameterized Complexity on a New Sorting Algorithm: A Study in Simulation<br />

Journal Title: Annals. Computer Science Series - Year 2009, Vol 7, Issue 2

Abstract

Sundararajan and Chakraborty (2007) introduced a new sorting algorithm by modifying the fast and popular Quick sort and removing the interchanges. In a subsequent empirical study, Sourabh, Sundararajan and Chakraborty (2007) demonstrated that this algorithm sorts inputs from certain probability distributions faster than others and the authors made a list of some standard probability distributions in decreasing order of speed, namely, Continuous uniform, Discrete uniform, Binomial, Negative Binomial, Poisson, Geometric, Exponential, Standard Normal. It is clear from this interesting second study that the algorithm is sensitive to input probability distribution. Based on these pervious findings, in the present paper we are motivated to do some further study on this sorting algorithm through simulation and determine the appropriate empirical model which explains its average sorting time with special emphasis on parameterized complexity.

Authors and Affiliations

Prashant KUMAR , Anchala KUMARI, Soubhik CHAKRABORTY

Keywords

Related Articles

Structural equation modeling of choice of place of delivery in Nigeria

Medical problems are often experienced during child delivery in a poor place of delivery and health care. The use of immediate health indicator as direct proxies for choice making biases estimates that these proxies are...

Development of an Expert System for Selected Blood Diseases Diagnosis and Treatment

Research had stated that there is increase in the number of people dying of blood diseases likewise there is a large number of people suffering from different kinds of blood diseases due to unavailability of human expert...

Algorithm Development for Mixture of Two Colors for Enhancement of New Color Development

Due to the problem that normally occur when colors are needed to be chosen for industrial uses, color are needed to be mixed together to generate new difference color. The algorithms were developed in two phases which co...

Using R for Actuarial Analysis in Valuation and Reserving

The introduction of R software into the statistical computing space has provided comprehensive language for managing and manipulating multidimensional data. Developing the capacity and skills of students and actuarial an...

Kerberos Authentication in Wireless Sensor Networks

We proposed an authentication mechanism in the wireless sensor network. Sensor network uses the Kerberos authentication scheme for the authentication of bases station in the network. Kerberos provides a centralized authe...

Download PDF file
  • EP ID EP123964
  • DOI -
  • Views 102
  • Downloads 0

How To Cite

Prashant KUMAR, Anchala KUMARI, Soubhik CHAKRABORTY (2009). Parameterized Complexity on a New Sorting Algorithm: A Study in Simulation<br /> . Annals. Computer Science Series, 7(2), 9-22. https://europub.co.uk/articles/-A-123964