Sign In
Courseware
Nuggets
Tutorials
Courses
CodePad
Create Account
☰
Question 1 of 4
Which of the following is true about merge sort?
Merge sort is an in-place sorting algorithm.
Merge sort has runtime of O(nlog(n)) even in worst cases.
Merge sort runs slower than insertion sort.
Submit
© CS Wonders
·
About
·
Gallery
·
Fun Facts
·
Cheatsheet