Computer Science, asked by madalaharikrishnahar, 5 hours ago

21. Which of the following represents linear time complexity in terms of big-O notation? (2 Points) O(N^2) O(log N) O(N) O O(N log N)​

Answers

Answered by tsgshubham18
0

Answer:

ngfrfhjnbhvhhyub jhhhb

Answered by amarjotk602
0

Answer:

Kjhgfngbrszbjkh gdfnkk

Explanation:

Hfvjlgdx. Lljtxcjifd

Similar questions