I am trying to figure out what the big o estimate of the following nested for loop is.
for(int i = 10; i to 100; i++){
for(int j = 1; j to i; j++){
for(int k = 1; k to j; k++){
s=s+i+j;
}
}
}
I was thinking that the two inner loops run n times but I am unsure about the first loop.
What would the Big O estimate be for this code?