I have to find computational complexity of an expression for Euclidean distance
d(x,y)= {(x1-x2)^2 + (y1-y2)^2}^1/2
But I have certain confusion because of which I am unable to proceed. Firstly there are two variables. Secondly since there is a root ,what will be its effect? If there were no roots, I can understand its worst case complexity would have been O(n^2).
I will really appreciate if someone can enlighten me in this regard Thanks in advance for your spending valuable time!
- Update
I assume that my program will run on abstract machine RAM.