Pergunta de entrevista da empresa Yandex

Find kth min element in unsorted integer array.

Respostas da entrevista

Sigiloso

14 de mar. de 2016

Simple QuickSelect algorithm O(n) average complexity.

Sigiloso

15 de ago. de 2016

The best way to do it to implement on of the algorithms which complexity time is O(nlogn) then use binary search to get kth integer