nihantanu
BAN USERThis code will take O(N^2)
public string SubsetSome()
{
int[] numbers = { 1, 2, 5, 7, 9, 11, 13 };
int sum , totalsum = 20, from = 0, to = 0, i = 0, j = 0;
for (i = 0; i < numbers.Length; i++)
{
sum = 0;
for (j = 0; j < numbers.Length; j++)
{
sum += numbers[j+i];
if (sum == totalsum)
{
from = i;
to = j+i;
break;
}
if (sum > totalsum)
break;
}
if(from!=0 && to!= 0 )
{
break;
}
}
return "From Index " + from + " ---- " + to + " Index";
}
- nihantanu February 19, 2013