MCPcopy Create free account
hub / github.com/arnauddri/algorithms / benchmarkShellSort

Function benchmarkShellSort

algorithms/sorting/shell-sort/shell_test.go:22–27  ·  view source on GitHub ↗
(n int, b *testing.B)

Source from the content-addressed store, hash-verified

20}
21
22func benchmarkShellSort(n int, b *testing.B) {
23 list := utils.GetArrayOfSize(n)
24 for i := 0; i < b.N; i++ {
25 sort(list)
26 }
27}
28
29func BenchmarkShellSort100(b *testing.B) { benchmarkShellSort(100, b) }
30func BenchmarkShellSort1000(b *testing.B) { benchmarkShellSort(1000, b) }

Callers 4

BenchmarkShellSort100Function · 0.85
BenchmarkShellSort1000Function · 0.85
BenchmarkShellSort10000Function · 0.85
BenchmarkShellSort100000Function · 0.85

Calls 1

sortFunction · 0.70

Tested by

no test coverage detected