Journal of Applied Sciences1812-56541812-5662orgz10.3923/jas.2009.397.400ShakeriS.JaliliM.SaadatiR.VaezpourS.M.CiricLj.2200992This research applied on a probabilistic quasi-metric
version of a fixed point theorem to obtain the existence of solution for
a recurrence equation associated to the analysis of Quicksort algorithms.
Actually, we will establish ther results in the more general framework
of probabilistic quasi-metric spaces because, in this context, the measurement
of the distance from a word x to another word y, automatically indicates
if x is a prefix of y or not, while the Baire metric does not provide
this information. Finally, will be applied our methods to prove the existence
(and uniqueness) of solution for some recurrence equations associated
to the asymptotic complexity analysis of Quicksort algorithms and Divide
and Conquer algorithms, respectively.]]>De Bakker, J.W. and E.P. De Vink,1998Chang, S.S., Y.J. Cho and S.M. Kang,2001Menger, K.,1942Romaguera, S., A. Sapena and P. Tirado,2007Schweizer, B. and A. Sklar,1983Sehgal, V.M. and A.T. Bharucha-Reid,1972