$ ./guess_the_language
Problem Solving — fill the blank
Problem Solving — fill the blank · medium · #56
Fill in merge sort's worst-case complexity.
# Merge sort worst case is O(n log ____)
Answer:
n
(also accepted: n)
Merge sort always splits and merges: O(n log n).
Play Problem Solving ▸
◂ #55
all Problem Solving — fill the blank questions
#57 ▸