A summary for my MA thesis.

Quick sorting algorithms and order statistics
Sorting of any kinds of algorithms is nowadays very often used. It allows to order data thanks to which we can find information we need easier. Time of this activity to a large degree depends on an algorithm we use to do this.
This work also touches on an order statistics issue. The order statistics are often used to calculate minimums and maximums. Presented here algorithms allow to identify for instance the 3rd smallest element in given sequence and don't base on sorting. More on this subject can be found in chapter II.
In this M.A. thesis there is a review of quick sorting algorithms. This work informs a reader of the order statistics issue and shows him how much sorting time depends on an algorithm we use to do that.
Chapter I contains descriptions of sorting algorithms: heapsort, quicksort, randomized-quicksort, radix-sort, bucket-sort, counting-sort
In Chapter II there are described methods by means of which we can find the minimum and the maximum in the given sequence and methods of searching the ith smallest element which don't require sorting.
Chapter III includes graphs presenting times in which the sorting algorithms described in Chapter I work.
On the attached CD there are programs thanks to which graphs in Chapter III were made.

I'll be grateful to you for any suggestions :-)