What is the worst-case performance of insertion sort?
A) O(log (n) )
B) O(n2)
C) O(n)
D) O(n log (n) )
Correct Answer:
Verified
Q22: When the size of an array increases
Q23: Merge sort is a(n) _ algorithm.
A)O(log n)
B)O(n
Q24: In Big-Oh notation, selection sort is a(n)
Q25: The number of element visits for merge
Q26: Consider the following code snippet: 
Q28: The merge sort algorithm presented in section
Q29: Which function has a faster growth rate:
Q30: Find the simplest order of growth of
Q31: Which sort algorithm starts with an initial
Q32: Choose the order of the following growth
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents