Mathmatical Prove of the Effectiveness of Quick Sort

1. The property of a sorted sequence are as follows:

       a) For an element with index x in a sorted sequence p, the following expression always holds:          [0, p[index-1]] < p[index] < [p[index+1], n]

       b) Every element only have one position (index) in the sequence

2. A sequence satisfied property a) and b) above must be sorted

Prove:

       1) Because property a) is true, so a[x] < a[x+1].

       2) Start from x=0 (index =0), we have a[0] < a[1];

                            x=1,                  we have a[1] < a[2];

                                        ..

                                                                    a[x] < a[x+1];

                                        ..

                            x=n                                  a[n-1] < a[n];

         We can construct an inequation

                           a[0] < a[1] < ... < a[n-1] < a[n]

           Therefore, sequence a[x] is an ordered sequence. 

3. The partition function in quick sort is to find the index of x in the sorted sequence and this index is unique. After all the index of the element is determined, we can thus construct a sorted sequence based on all the indices.