An algorithm with worst case time behaviour = 3n takes 30 operations for every input of size n = 10
A. Both (i) and (ii) are false
B. Both (i) and (ii) are true
C. (i) is false and (ii) is true
D. (i) is true and (ii) is false
Answer:D
An algorithm with worst case time behaviour = 3n takes 30 operations for every input of size n = 10
A. Both (i) and (ii) are false B. Both (i) and (ii) are true C. (i) is false and (ii) is true D. (i) is true and (ii) is false