Question

Best case complexity of insertion sorting is _______ .

• A. O(n)
• B. O(n\log n)
• C. O(n\(^2\))
• D. O(\(\log n\))

Hint:

Insertion Sort is efficient for small or nearly sorted datasets, where the best case complexity is \(O(n)\).

Answer 1

The Correct Option is A

The best case complexity of Insertion Sort occurs when the input is already sorted. In this case, the algorithm only needs to make one pass through the data, resulting in a time complexity of \(O(n)\). In the worst case (when the data is sorted in reverse order), the time complexity is \(O(n^2)\).