Answer Happy

Posted: **Mon May 09, 2022 6:31 am**

: What Is The Time Complexity Of The Following Three Algorithms Express Your Answer In Terms Of Big O Notation And Justi 1 (15 KiB) Viewed 34 times

What is the time complexity of the following three algorithms? Express your answer in terms of Big- O notation and justify your answer: A) def display_names_with_ID (names): ID = 0; for n in names: print ("ID for ", n, "is", ID) ID = ID + 1 [2 marks]