常用算法

public static void main(String[] args) {
int a[] = { 49, 38, 65, 97, 76, 13, 27, 49, 78, 34, 12, 64, 5, 4, 62, 99, 98, 54, 56, 17, 18, 23, 34, 15, 35,
25, 53, 51 };
int temp = 0;
int j = 0;
for (int i = 1; i < a.length; i++) {
if (a[i] < a[i - 1]) {
temp = a[i];
for (j = i - 1; j >= 0 && a[j] > temp; j--) {
a[j+1]=a[j];
}
a[j+1] = temp;
}

}
for(int k:a){
System.out.print(k+",");
}
}

int a[] = { 49, 38, 65, 97, 76, 13, 27, 49, 78, 34, 12, 64, 5, 4, 62, 99, 98, 54, 56, 17, 18, 23, 34, 15, 35,
25, 53, 51 };
for(int i=0;i<a.length-1;i++){
for(int j=i;j<a.length-i-1;j++){
if(a[j]>a[j+1]){
int temp = a[j];
a[j]=a[j+1];
a[j+1] = temp;
}
}

}

for(int k:a){
System.out.print(k+",");
}

}

public static void main(String[] args) {
int a[] = { 49, 38, 65, 97, 76, 13, 27, 49, 78, 34, 12, 64, 5, 4, 62, 99, 98, 54, 56, 17, 18, 23, 34, 15, 35,
25, 53, 51 };
for(int i=0;i<a.length-1;i++){
for(int j=i;j<a.length-i-1;j++){
if(a[j]>a[j+1]){
int temp = a[j];
a[j]=a[j+1];
a[j+1] = temp;
}
}

}
int low = 0;
int high = a.length-1;
while(low<=high){
int mid = (low+high)/2;
if(78==a[mid]){
System.out.print("数组位置："+mid);
break;
}
else if(78<a[mid]){
high = mid-1;
}
else{
low = mid+1;
}
}

}

private static int halfSearch(int[] a,int low,int high,int target){
if(low>high){
return -1;

}
else{
int mid = low+high;
if(target == a[mid]){
return mid;

}
else if(target < a[mid]){
return halfSearch(a,low,mid-1,target);
}else return halfSearch(a,mid+1,high,target);
}

}

public static void main(String[] args) {
int a[] = { 1,2,45,78,56,22};
for(int i =0;i<a.length/2;i++){
int k = a[i];
a[i]=a[a.length-i-1];
a[a.length-i-1]=k;
}