Find the smallest positive integer value that cannot be represented as sum of any subset of a given ...

Please Visit: http://ift.tt/1ajReyV

Find the smallest positive integer value that cannot be represented as sum of any subset of a given array - GeeksforGeeks



Given a sorted array (sorted in non-decreasing order) of positive numbers, find the smallest positive integer value that cannot be represented as sum of elements of any subset of given set.

Expected time complexity is O(n).

Examples:

Input: arr[] = {1, 3, 6, 10, 11, 15};

Output: 2

Input: arr[] = {1, 1, 1, 1};

Output: 5

http://ift.tt/1qIK3LJ

http://ift.tt/1tPsWvi

Find the smallest positive integer value that cannot be represented as sum of any subset of a given array - GeeksforGeeks

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1tPsZqU

via LifeLong Community