I am having trouble calculating the time complexity for these for loops:
for(int i=0; i<len; i++){
countOne++;
for(int j=i/2; j<len; j++){
countTwo++;
for(int k=i/2; k<len; k++){
countThree++;
}
}
}
I don't understand how to calculate the time complexity for the 2 inner-most loops.

Big O? right ?