Partition Sort versus Quick Sort: A Comparative Average Case Analysis with Special Emphasis on Parameterized Complexity

Niraj Kumar Singh, Soubhik Chakraborty. Partition Sort versus Quick Sort: A Comparative Average Case Analysis with Special Emphasis on Parameterized Complexity. In Natarajan Meghanathan, Dhinaharan Nagamalai, Nabendu Chaki, editors, Advances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology (ACITY) July 13-15, 2012, Chennai, India - Volume 2. Volume 177 of Advances in Intelligent Systems and Computing, pages 107-113, Springer, 2012. [doi]

@inproceedings{SinghC12,
  title = {Partition Sort versus Quick Sort: A Comparative Average Case Analysis with Special Emphasis on Parameterized Complexity},
  author = {Niraj Kumar Singh and Soubhik Chakraborty},
  year = {2012},
  doi = {10.1007/978-3-642-31552-7_12},
  url = {http://dx.doi.org/10.1007/978-3-642-31552-7_12},
  researchr = {https://researchr.org/publication/SinghC12},
  cites = {0},
  citedby = {0},
  pages = {107-113},
  booktitle = {Advances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology (ACITY) July 13-15, 2012, Chennai, India - Volume 2},
  editor = {Natarajan Meghanathan and Dhinaharan Nagamalai and Nabendu Chaki},
  volume = {177},
  series = {Advances in Intelligent Systems and Computing},
  publisher = {Springer},
  isbn = {978-3-642-31551-0},
}