What is the overall time complexity of the merge sort algorithm?A. O(n log n)B. O(log n)C. O(n)D. Olog(n) 0 0 votesArticle Rating Subscribe LoginNotify of new follow-up commentsnew replies to my comments Label {} [+] Name* Email* Website Label {} [+] Name* Email* Website 0 Comments Oldest Newest Most Voted Inline FeedbacksView all comments
