@article{sourabh2000robust,
  author = {Sourabh, Suman Kumar and Soubhik, Chakraborty},
  editor = {Structures, Computer Science Data Algorithms},
  interhash = {e9e92f0a610a9803d21dc7c568579e36},
  intrahash = {f99df70b03ce8a21199e43ee39831c47},
  journal = {Computer Science - Data Structures and Algorithms,Computer Science - Computational Complexity},
  title = {How robust is quicksort average complexity?},
  url = {https://arxiv.org/ftp/arxiv/papers/0811/0811.4376.pdf},
  year = 2000
}

@article{anchala2007statistical,
  author = {Anchala and Kumari and Soubhik and Chakraborty},
  editor = {MATHEMATICS, APPLIED COMPUTATION},
  interhash = {ef94db879b3faa6cb743eada2f55636f},
  intrahash = {4ca9153e6f94a5f314827a20e07ba36a},
  journal = {APPLIED MATHEMATICS AND COMPUTATION},
  title = {A statistical case study through insertion sort},
  url = {https://www.researchgate.net/publication/220557053_Software_complexity_A_statistical_case_study_through_insertion_sort},
  year = 2007
}