Prove Merge Sort Complexity
Prove that the average case time complexity of merge sort is O(nlog(n))
A distressed Keanu Reeves is buried up to his neck beside a phone displaying a demand to prove that merge sort has average-case time complexity O(nlog(n)). The joke exaggerates the panic and suffering caused by a difficult algorithms homework or exam problem, making it useful as a reaction to overwhelming computer science tasks.
- @dev_meme / 1992 2020-09-01
- Type
- image
- Size
- 797×800 · 137.1 KiB
- Mood
- panicked, absurd
- Language
- en
- Added