Non-Big-O Notation: What is the time complexity of 2 comparison operations joined by "and"?

Asked Nov 01 '20 at 00:54

Active Nov 01 '20 at 00:54

Viewed 29 times

I'm currently doing a class assignment and would like to ask a quick question about time complexity whenever we have 2 comparison operators joined by the word "and". Would it be O(1) or O(2) in Non-Big-O notation? Because I want to trace every operation in my own algorithm. For instance, What would be the time complexity of line A in Non-Big-O notation would it be O(2)?

list1 = []
counter = 0
If len(list1) > 0 and counter!= max:  #line A
  list1.append(counter)
  counter += 1

return list1

asked Nov 01 '20 at 00:54

CodeSleepRepeat

"O(2)" isn't a thing so I don't really know what you're talking about with that, but in general terms, if you want to see how long an operation takes you can time it. – TigerhawkT3 Nov 01 '20 at 01:08
Yup I understand Big-O where its mostly O(1) if we have a constant operation. But as I need to trace every operation in this assignment, I'm wondering if the code len(list1) > 0 and counter!= max actually performs exactly 2 computations instead of 1. – CodeSleepRepeat Nov 01 '20 at 01:22
What is "non-big-O" notation? This Stack Overflow question is the only relevant thing that shows up on Google when searching for it. – kaya3 Nov 01 '20 at 02:23
I meant it as the exact number of computations – CodeSleepRepeat Nov 01 '20 at 03:40
Time it and find out. – TigerhawkT3 Nov 01 '20 at 21:46
Alright, point noted. Thank you! – CodeSleepRepeat Nov 02 '20 at 05:51

Non-Big-O Notation: What is the time complexity of 2 comparison operations joined by "and"?

0 Answers0