algorithms/sorting/sort_test.go
2021-12-16 19:37:48 +02:00

45 lines
752 B
Go

package sorting
import (
"testing"
)
func TestSelectionSlice(t *testing.T) {
CheckSliceSorter(Selection[int])
}
func BenchmarkSelection(b *testing.B) {
for i := 0; i < b.N; i++ {
BenchmarkSort(10000, Selection[int])
}
}
func TestInsertion(t *testing.T) {
CheckSliceSorter(Insertion[int])
}
func BenchmarkInsertion(b *testing.B) {
for i := 0; i < b.N; i++ {
BenchmarkSort(10000, Insertion[int])
}
}
func TestShell(t *testing.T) {
CheckSliceSorter(Shell[int])
}
func BenchmarkShell(b *testing.B) {
for i := 0; i < b.N; i++ {
BenchmarkSort(10000, Shell[int])
}
}
func TestMerge(t *testing.T) {
CheckSliceSorter(Merge[int])
}
func BenchmarkMerge(b *testing.B) {
for i := 0; i < b.N; i++ {
BenchmarkSort(10000, Merge[int])
}
}