Go concurrent linear search with Python verification and test generation

genTest.py

import random

if __name__ == '__main__':
    nums = [str(random.randint(0, 100000)) for _ in range(100)]
    toFind = random.choice(nums)
    ans = open('ans.txt', 'w+')
    ans.write(str(nums.index(toFind)) + '\n')
    ans.close()
    print(toFind + ' ' + ' '.join(nums))

runTests.sh

go run search.go `python genTests.py` && cat ans.txt

search.go

package main

import (
	"fmt"
	"os"
	"strconv"
)

func simpleLinSearch(slice []int, num int, c chan int, start int) {
	for index, item := range slice {
		if item == num {
			c <- index + start
			return
		}
	}
	c <- -1
}

func search(slice []int, num int) int {
	c := make(chan int)
	go simpleLinSearch(slice[:len(slice)/2], num, c, 0)
	go simpleLinSearch(slice[len(slice)/2:], num, c, len(slice)/2)
	x, y := <-c, <-c
	if x == -1 {
		return y
	} else {
		return x
	}
}

func toNums(nums []string) []int {
	res := make([]int, len(nums), len(nums))
	for index, item := range nums {
		n, _ := strconv.Atoi(item)
		res[index] = n
	}
	return res
}

func main() {
	nums := toNums(os.Args[1:])
	fmt.Printf("%d\n", search(nums[1:], nums[0]))
}