k-th smallest element in Array

Saw this in CS247.

We can use Heap.

Apparently, solution 4 is the best, because $k\log n$ is better than $n\log k$.

However, it seems that there is an even better way, using Quickselect? https://www.freecodecamp.org/news/quickselect-algorithm-explained-with-examples/