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

Function benchmarkQuickSort

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

Source from the content-addressed store, hash-verified

20}
21
22func benchmarkQuickSort(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 BenchmarkQuickSort100(b *testing.B) { benchmarkQuickSort(100, b) }
30func BenchmarkQuickSort1000(b *testing.B) { benchmarkQuickSort(1000, b) }

Callers 4

BenchmarkQuickSort100Function · 0.85
BenchmarkQuickSort1000Function · 0.85
BenchmarkQuickSort10000Function · 0.85
BenchmarkQuickSort100000Function · 0.85

Calls 1

sortFunction · 0.70

Tested by

no test coverage detected