Computer Science
This media is not supported in your browser
VIEW IN TELEGRAM
Quick Sort 🆚 Merge Sort, which is faster?
Both have an average time complexity of O(n log n)
👍 👍 👍 👍 👍
🧿 @ComputerScience
Both have an average time complexity of O(n log n)
Please open Telegram to view this post
VIEW IN TELEGRAM