What is the best-case running time of merge sort when searching a single-dimensional array of size n? A) O( n² log n ) B) O( n ) C) O( n log n ) D) O( n² )

Name: What is the best-case running time of merge sort when searching a single-dimensional array of size n? A) O( n 2 log n ) B) O( n ) C) O( n log n ) D) O( n 2 )
Brand: Quizplus
Rating: 4.8 (36 reviews)

Question

Quizplus · Accepted Answer

The best-case running time of merge sort is O(n log n) because it always divides the array into two halves and then merges them, regardless of the initial order of elements.

What Is the Best-Case Running Time of Merge Sort When