Merge sort is a(n) ____ algorithm. A)O(log n) B)O(n log(n)) C)O(n²) D)O(n)

Name: Merge sort is a(n) ____ algorithm. A)O(log n) B)O(n log(n)) C)O(n 2 ) D)O(n)
Brand: Quizplus
Rating: 4.8 (43 reviews)

Question

Quizplus · Accepted Answer

Merge sort has a time complexity of O(n log(n)), which means that as the size of the input grows, the time it takes to complete the algorithm increases at a rate proportional to the logarithm of the size of the input. This makes it an efficient choice for large data sets.

Merge Sort Is A(n) ____ Algorithm