Review Note
Last Update: 11/26/2024 11:19 AM
Current Deck: Robotics and AI::Year 1::Term 2::Data Structures and Algorithms
PublishedCurrently Published Content
Text
The running time of merge sort in the worst case is {{c1::\( O(n \log n) \)}}, making it more efficient than insertion sort for large datasets.
Extra
No published tags.
Pending Suggestions
No pending suggestions for this note.