A New Look at Worst Case Complexity: A Statistical Approach
Keyword(s):
We present a new and improved worst case complexity model for quick sort as yworst(n,td)=b0+b1n2+g(n,td)+ɛ, where the LHS gives the worst case time complexity, n is the input size, td is the frequency of sample elements, and g(n,td) is a function of both the input size n and the parameter td. 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, yworst(n)=b0+b1n+b2n2+ɛ, which stems from the worst case O(n2) complexity for this algorithm.
1992 ◽
Vol 42
(3)
◽
pp. 145-149
◽
Keyword(s):
1998 ◽
Vol 19
(3-4)
◽
pp. 329-343
◽
2011 ◽
Vol 03
(04)
◽
pp. 457-471
◽
Keyword(s):
2012 ◽
Vol 1
(1-2)
◽
pp. 143-153
◽