2.2 - Linear Time Selection (Median of Medians Algorithm)

Описание к видео 2.2 - Linear Time Selection (Median of Medians Algorithm)

The selection problem asks to report the kth smallest element in an unsorted array. It is easily solvable in O(n log n) time via sorting and the Median of Medians Algorithm solves this in O(n) time via a clever Divide and Conquer strategy.

Комментарии

Информация по комментариям в разработке