🎴 Flashcard Mode
Data Structures and Algorithms Quiz
Card1 / 20
Mastered0
Review0
QuestionClick to flip
The complexity of merge sort algorithm is
AnswerClick to flip back
A
O(n log n)
💡 Explanation:
Merge sort has O(n log n) complexity because it divides the array in half log n times (the divide step) and merges n elements at each level (the conquer step). This gives n × log n operations.