sort/shell.go


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

package sort

import (
	"algorithms/ds"
)

func Shell(a []ds.Comparer) []ds.Comparer {
	length := len(a)
	// h-sort the array
	h := 1

	for h < length/3 {
		// 1, 4, 13, 40, 121, 364, 1093...
		h = 3*h + 1
	}

	for h >= 1 {
		for i := h; i < length; i++ {
			for j := i; j >= h; j -= h {
				if a[j-h].Lower(a[j]) {
					break
				}
				tmp := a[j]
				a[j] = a[j-h]
				a[j-h] = tmp
			}
		}

		h /= 3
	}

	return a
}