Skip to content

Latest commit

 

History

History
34 lines (20 loc) · 413 Bytes

File metadata and controls

34 lines (20 loc) · 413 Bytes
title date draft tags categories
Algorithm4 Java Solution 2.1.06
2019-08-30 23:38:31 +0800
false
JAVA
TECH
archives

2.1.06

Problem:

Which method runs faster for an array with all keys identical, selection sort or insertion sort?

Solution:

insertion sort ~N

selection sort ~N^2/2

insertion sort is faster

code:

Ex_2_1_06.java

Reference: