Sum of all elements between k1'th and k2'th smallest elements - GeeksforGeeks
Given an array of integers and two numbers k1 and k2. Find sum of all elements between given two k1'th and k2'th smallest elements of array. It may be assumed that (1 <= k1 < k2 <= n) and all elements of array are distinct.
Read full article from Sum of all elements between k1'th and k2'th smallest elements - GeeksforGeeks
No comments:
Post a Comment