binarySearch_test.go

package binarySearch

import "testing"

// The recursive version of binary search.

func TestSearchRecursive(t *testing.T) {
	cases := []struct {
		in           []int
		search, want int
	}{
		{[]int{1, 2, 46, 74, 89, 105}, 89, 4},
		{[]int{5, 6, 78, 343, 568, 999}, 1000, -1},
		{[]int{0, 0, 23, 34, 450, 550, 555, 679, 843}, 843, 8},
		{[]int{10, 16, 80, 143, 268, 599, 768}, 10, 0},
	}

	for _, c := range cases {
		got := SearchRecursive(c.in, c.search, 0, len(c.in)-1)

		if got != c.want {
			t.Errorf("Search for (%v) in %v\n Result = %v,\n Wants = %v", c.search, c.in, got, c.want)
		}
	}
}

//  The iterative version of binary search.

func TestSearchIterative(t *testing.T) {
	cases := []struct {
		in           []int
		search, want int
	}{
		{[]int{1, 2, 46, 74, 89, 105}, 89, 4},
		{[]int{5, 6, 78, 343, 568, 999}, 1000, -1},
		{[]int{0, 0, 23, 34, 450, 550, 555, 679, 843}, 843, 8},
		{[]int{10, 16, 80, 143, 268, 599, 768}, 10, 0},
	}

	for _, c := range cases {
		got := SearchIterative(c.in, c.search)

		if got != c.want {
			t.Errorf("Search for (%v) in %v\n Result = %v,\n Wants %v", c.search, c.in, got, c.want)
		}
	}
}