Don’t think it in terms of operations, they vary a lot depending on thy type , even when all are trivial operations.Like addition is faster than say decimal division, although we consider both constant time.

Instead look at it this way, when you want to check whether the complexity that you get is the best, just get the number of iterations your loop will make(handle nested loops accordingly) and multiply that to the complexity of the function you do within those loops.

For example(in Java):

```
for(int i = 0 ; i < 10^5 ; i++){
for(int j = 0 ;j < 10^2 ; j++ ){
set[i].add( arr[j] ) // arr is some array and set is an array of set
}
}
```

Here, since the complexity of adding an element to a set is O(log n), therefor total complexity will be O(10^5 * 10^2 * log(10^5*10^2)). If this is lesser than or about equal to 10^8, you are fine to go.*

In this case it will be, as log(10^7) is approx ~ 20, so #computations = 10^7 * log 10^7=210^8, which should run.

Remember, in most cases, the loop constraints will be dependent on various other things , so the loop probably wont run this many time in any scenario, so this method should be fine for calculating the complexity and the gross number of operations.