Data Structures and Algorithms - Old Questions
1.
v) What is the Big-Oh of best case complexity of insertion sort?
a) O (n) b) O (nlogn) c) O (1) d) O (n2)
1 marks
|
Asked in 2019-Objective
(a)