All Questions
Tagged with dynamic-programmingsorting
1 question
7votes
3answers
496views
Picking m number in the best possible time
Imagine we want to pick m numbers from n numbers so that the difference of the maximum and minimum of the m numbers be minimum, for example if m = 4 n =6 numbers: 10 12 10 7 5 22 The ...
- 135
