If I’m not mistaken, quick sort is worst case O(n^2), merge sort is what actually achieves O(nlogn), the point is that quicksort is on average more memory (and time?) efficient
- Posts
- 12
- Comments
- 471
- Joined
- 3 yr. ago
- Posts
- 12
- Comments
- 471
- Joined
- 3 yr. ago
- JumpDeleted
Permanently Deleted
- JumpDeleted
Permanently Deleted
- JumpDeleted
Permanently Deleted
Pretty sure they could just say that russia has a bunch of extra women