Table of Contents
International Journal of Analysis
Volume 2014, Article ID 840432, 10 pages
Research Article

A New Look at Worst Case Complexity: A Statistical Approach

1Department of Computer Science & Engineering, B.I.T. Mesra, Ranchi 835215, India
2Department of Applied Mathematics, B.I.T. Mesra, Ranchi 835215, India

Received 5 June 2014; Revised 17 September 2014; Accepted 18 September 2014; Published 29 December 2014

Academic Editor: Baruch Cahlon

Copyright © 2014 Niraj Kumar Singh et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We present a new and improved worst case complexity model for quick sort as , where the LHS gives the worst case time complexity, is the input size, is the frequency of sample elements, and is a function of both the input size and the parameter . The rest of the terms arising due to linear regression have usual meanings. We claim this to be an improvement over the conventional model; namely, , which stems from the worst case complexity for this algorithm.