algo_basic

func BinarySearch ¶

func BinarySearch(arr []int, l, r, value int) int

BinarySearch must be sorted Arr else Meaningless but the algo is not accurate when the same element occurs over twice times.

func CharToInt ¶

func CharToInt(char rune) int

func IntToChar ¶

func IntToChar(intNum int) interface{}

func IntToStr ¶

func IntToStr(intValue int) string

func LowerBound ¶

func LowerBound(arr []int, l, r, value int) int

LowerBound from l find the first arr[i] <= value example. {10,10,20,20,20,20,30,30},0,7,20 return index is 2 algo complex is O(log(r-l))

func MaxValue ¶

func MaxValue(compValue, compedValue int) int

func MinValue ¶

func MinValue(compValue, compedValue int) int

func MyAbs ¶

func MyAbs(value int) int

func StrToInt ¶

func StrToInt(str string) int

func UpperBound ¶

func UpperBound(arr []int, l, r, value int) int

UpperBound from r find the first arr[i] > value example. {10,10,20,20,20,20,30,30},0,7,20 return index is 6 algo complex is O(log(r-l))