Calculating maximum sum of any random k elements in an array Recursively ( without any constraints)

Question

What would be the fastest way to find the maximum of n elements within an array. (They don\'t need to be consecutive)

Eg a={1 ,3, 2, 5, 0, 10}

maximum sum when n=2