Shell Sort
- General Idea
- If the gap values are values of 2^k - 1, the sort is O(n^1.5)
- The analysis of shell sort is very tricky. Mathematicians are
still studying it, 45 years after the algorithm was published!
Empirical Analysis
- System.currentTimeMillis();
Class Code