| title | date | draft | tags | categories | |||
|---|---|---|---|---|---|---|---|
Algorithm4 Java Solution 2.1.06 |
2019-08-30 23:38:31 +0800 |
false |
|
|
Which method runs faster for an array with all keys identical, selection sort or insertion sort?
insertion sort ~N
selection sort ~N^2/2
insertion sort is faster
code: