关于冒泡排序和优化
冒泡的算法运作如下:
1,比较相邻的元素,如果第一个比第二个大,交换它们的位置
2,对每一对相邻元素作同样的工作,从第一对开始到结尾的最后一对,最后的元素应该是最大的
3,针对所有的元素重复以上的步骤,除了已经排好的
4,重复上面的步骤,知道没有任何一对数字需要比较
import java.util.Arrays;
public class TestBybbleSort {
public static void main(String[] args) {
int[] values = {9,15,18,89,0,33,24,6};
for (int j = 0; j <values.length ; j++) {
for (int i = 0; i <values.length-1 -j ; i++) {
if (values[i] > values[i+1]) {
int tmp = 0;
tmp = values[i];
values[i] = values[i+1];
values[i+1] = tmp;
}
System.out.println(Arrays.toString(values));
}
System.out.println("======");
}
}
}
优化如下
import java.util.Arrays;
public class TestBybbleSort {
public static void main(String[] args) {
//int[] values = {9,15,18,89,0,33,24,6};
int[] values = {1,2,3,4,5,6,7,8,9};
for (int j = 0; j <values.length ; j++) {
int tag = 0;
for (int i = 0; i <values.length-1 -j ; i++) {
if (values[i] > values[i+1]) {
int tmp = 0;
tmp = values[i];
values[i] = values[i+1];
values[i+1] = tmp;
tag = -1;
}
System.out.println(Arrays.toString(values));
}
if (tag == 0) {
break;
}
System.out.println("======");
}
}
}
二分查找(折半查找)
import java.util.Arrays;
public class TestMyBinarySearch {
public static void main(String[] args) {
int[] array = {1,3,56,4,9,0,15,12,14,33,31,46,44};
Arrays.sort(array);
System.out.println(Arrays.toString(array));
System.out.println(myBinarySearch(array,100));
}
public static int myBinarySearch(int[] arr,int value) {
int left = 0;
int right = arr.length - 1;
while(left <= right) {
int mid =(left + right)/2;
if(value > arr[mid]) {
left = mid+1;
}
if (value < arr[mid]) {
right = mid -1;
}
if (value == arr[mid]) {
return mid;
}
}
return -1;
}
}