Disclaimer: Not a HW.Given $n$ sorted positive floating point numbers, and one has to find the minimum subset sum of size $n-k$. What would be the most efficient way? I can figure out using Brute force becomes $O(n^{n-k})$
Complexity for minimum subset sum of size n-k
algorithms;asymptotics