I was giving an Interview.

INTERVIEWER: You have an array and you have to find k smallest element in that array and you have to be efficient as well?  

EX: [2,1,4,5,0] and if input is 3 then output will be 0,1,2.

ME: I'll take k variables and iterate over each element of array and will store all different k smallest values in k different variables.

INTERVIEWER: What if you have millions of data and you have to find 10000 smallest variables?

ME: Yeah, taking 10000 variables is not practically possible. So, I'll iterate Bubble sort for 10,000 times over millions of data.

INTERVIEWER: No, okay next question!

> 
> So, I want to know what is the correct method for finding k smallest
>  number in an array, specially when k is some very large number?
> 
> 
>