The author posted a question in Programming
Help me count the number of operations in an algorithm? and got a better answer
Response from
Response from 0[+++++]
Where did it come fromI calculate at best the difficulty is 14= O 1 if the second line is already 2 n+1= O n without any conditions?
Where did it come fromI calculate at best the difficulty is 14= O 1 if the second line is already 2 n+1= O n without any conditions?