In this lecture we introduce randomized algorithms in terms of the case study of randomized quicksort. We give the full analysis to find the expected running time of the algorithm which turns out to be O(n log n). The instruction language is Arabic, however, all slides, formulations, definitions, concepts, etc., are given in English.
