Finding the k-th smallest element in an unsorted array is a very common problem in data structures and algorithms. This is one of the favorite questions in coding interviews, competitive programming contests, and technical exams. It also has real-world use cases in data analysis, search engines, and statistical calculations.
The problem is: Given an unsorted array of numbers, how do you find the element that would appear in the k-th position if the array was sorted?