This project implements an optimized version of the Quicksort algorithm in C++, using a randomized pivot selection (first or last index during the partition). Additionally, the project features a manual analysis of the algorithm's running time in the worst-case and average-case scenarios.