/**
* @param data Array with search (array)
* @param target target data
* @return returns the corresponding subscript, -1 means Not found
*/
public static int binarySearch(int[] data, int targ
Tag: Two points
Four sorting algorithms and two points
1. Bubble sorting
func BubbleSort(slice []int) []int {
i, j, okay, count := 0, 0, true, len(slice)
for i = 0; i slice[j+1] {
slice[j], slice[j+1] = slice[j+1], slice[j]
okay = false
}
}
if o