binary search

func binary(T *arr, tot *int){

var key string

sort(&*T, &*tot)

btm:=0
top:= *tot
found := false

fmt.Print("Cari Materi : ")
fmt.Scan(&key)
	for (top >= btm) && (found == false) {
        mid := (btm + top) / 2
        if key< T[mid].mat {
            top = mid
        }else if key == T[mid].mat {
            found = true
				fmt.Println(".::::::::::::::::::::::::::::::::::::::::::::::.")
				fmt.Println(":: ID			: ", T[mid].id , "                   ::")
				fmt.Println(":: Sekolah 	: ", T[mid].sekul , "                ::")
				fmt.Println(":: Kelas  		: ", T[mid].kls 	, "                ::")
				fmt.Println(":: Pelajaran 	: ", T[mid].pel   , "              ::")
				fmt.Println(":: Semester  	: ", T[mid].smt   , "              ::")
				fmt.Println(":: Silabus   	: ", T[mid].silb  , "              ::")
				fmt.Println(":: Materi	  	: ", T[mid].mat , "                ::")
				fmt.Println("::::::::::::::::::::::::::::::::::::::::::::::::")
		}else {
			btm = mid + 1
		}
    }


   if found==false {
        fmt.Print("Data tidak ditemukan")
    }

}

func sort(T *arr, tot *int){
	for i:=0; i<*tot; i++{
		min:=i
		j:=i+1
		for j<=*tot{
			if T[j].mat<T[min].mat{
				min = j
			}
			j++
		}
		temp:=T[min]
		T[min]= T[i]
		T[i]= temp

	}
}