For big-O notation, would a program where inside of a for loop, x= 2*3 and y = 2*4*5234*3452*25 be considered O(n) = 2n even though y would take longer to calculate? Does the size of each individual calculation not matter when talking about big-O?
valid question