←
↑
↓
→
You can use arrow keys to navigate in the map.
Loading tree...
Merge sorts are more useful than shell sorts
-
because
score: 2
Merge sorts are O(n*log(n))
-
but
score: 2
For some data structures, or in poor implementations, it can take much more memory than a shell sort
-
however
score: 1
They're both better than bubble sorts
-
but
score: 1
It's less adaptive to changes in the class of the sorted elements.
-
because
score: 1
Merge sorts do not require random access to the data
-
because
score: 0
Merge sorts are much more human readable
-
but
score: -1
It's slightly slower if done serially
- 6 branch
- ‒
The argument is too complex. You can switch to list view.
gappleto97
