Application of fixed point theorem in probabilistic metric space to quicksort algorithm

Abstract

Our aim in this work is to prove the existence and uniqueness of solution for recurrence equations associated to the asimptotic complexity analysis of Quicksort algorithms using some results from the theory of probabilistic metric spaces.