In-place sorting algorithm for the k smallest integers in an array on n distinct integers?

It runs in place in O(n^2). Just stop after you've found k smallest elements.

IF so, what you are looking for is generalized median find algorithm which runs in O(n) (Just google for median find algorithm).

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.