SEARCH

User ID: 999999
Version: 4.37.48

www.memory.com
You are in browse mode. You must login to use MEMORY

   Log in to start


« Previous
Next »
From course:

Computer science

» Start this Course
(Practice similar questions for free)
Question:

Which type of sorting algorithms does not have a worst-case running time of O(n2)?

Author: Fender Tremolo


Answer:

Merge sort


0 / 5  (0 ratings)

1 answer(s) in total

Author

Fender Tremolo
Fender Tremolo