简单查找算法

import java.util.Arrays;
public class Find{
public static void main(String args[]){
int arr[]= {23,3,2,5,6,8,34,12,33};
//printArr(bubbleSort(arr));
printArr(arr);
//print(halfSearch(arr,5));
//print(Arrays.binarySearch(arr,5));
printArr(reverseArr(arr));
}

//反转数组
public static int[] reverseArr(int arr[]){
int num1 = 0,num2 = arr.length - 1;
while(num1<num2){
int temp = arr[num1];
arr[num1] = arr[num2];
arr[num2] = temp;
num1++;
num2--;
}
return arr;
}

//折半查找
public static int halfSearch(int arr[],int key){
int start = 0,end = arr.length-1,middle;
while(start<=end){
middle = (start + end)/2;
if(arr[middle]>key){
end = middle -1;
}else if(arr[middle]<key){
start = middle + 1;
}else{
return middle;
}
}
return -1;
}

//快速查找
public static int quickFind(int arr[],int key){
for(int i=0;i<arr.length;i++){
if(arr[i]==key){
return i;
}
}
return -1;
}

//冒泡排序
public static int[] bubbleSort(int arr[]){
for(int i=0;i<arr.length-1;i++){
for(int j=0;j<arr.length-i-1;j++){
if(arr[j]>arr[j+1]){
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
return arr;
}

//快速排序
public static int[] quickSort(int arr[]){
for(int i=0;i<arr.length-1;i++){
for(int j=i;j<arr.length;j++){
if(arr[i]>arr[j]){
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
return arr;
}

//打印数组
public static void printArr(int arr[]){
 System.out.print("[");
for(int i=0;arr!=null&&i<arr.length;i++){
if(i!=arr.length-1){
System.out.print(arr[i]+",");
}else{
System.out.print(arr[i]);
}
}
System.out.println("]");
}

public static<T> void print(T t){
System.out.println(t.toString());
}
}