在计算运行时复杂度时如何找出基本操作？

I am trying to get the worst run-time complexity order on a couple of algorithms created. However I have run into a problem that I keep tending to select the wrong or wrong amount of fundamental operations for an algorithm.I am trying to get the worst run-time complexit