algorithms/sorting/sort_test.go

package sorting

import (
	"testing"
)

func TestSelection(t *testing.T) {
	CheckSorter(NewSelection())
}

func BenchmarkSelection(b *testing.B) {
	for i := 0; i < b.N; i++ {
		BenchmarkSort(10000, NewSelection())
	}
}

func TestInsertion(t *testing.T) {
	CheckSorter(NewInsertion())
}

func BenchmarkInsertion(b *testing.B) {
	for i := 0; i < b.N; i++ {
		BenchmarkSort(10000, NewInsertion())
	}
}

func TestShell(t *testing.T) {
	CheckSorter(NewShell())
}

func BenchmarkShell(b *testing.B) {
	for i := 0; i < b.N; i++ {
		BenchmarkSort(10000, NewShell())
	}
}