1.冒泡排序(时间复杂度( n^2))
int[] arr = {78,89,67,98,90,56,88};
for(int i=0; i<arr.length-1; i++){
for(int j=0; j<arr.length-1-i; j++){
if(arr[j]>arr[j+1]){
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
for(int a:arr){
System.out.print(a+" ");
}
2.快速排序(时间复杂度(最坏时间复杂度为O(n2),平均时间复杂度为O(n*log2n) ))
int arr[] = new int[]{3,3,3,7,9,122344,4656,34,34,4656,5,6,7,8,9,343,57765,23,12321};
int len = arr.length-1;
arr=qsort(arr,0,len);
for (int i:arr) {
System.out.print(i+"\t");
}
int[] array = {78,89,67,98,90,56,88};
for (int i = 0; i < array.length; i++)
{
int start = 0;int end = i - 1;
int middle = 0;
int temp = array[i];
while (start <= end)
{
middle = (start + end) / 2;if (array[middle] > temp)//要排序元素在已经排过序的数组左边
{
end = middle - 1;
}
else
{
start = middle + 1;
}
}
for (int j = i - 1; j > end; j--)//找到了要插入的位置,然后将这个位置以后的所有元素向后移动
{
array[j + 1] = array[j];
}array[end + 1] = temp;
}
for(int a:array){
System.out.print(a+" ");
}
3.二分法查找(时间复杂度(O(logn)))
/**
* 一个数组,输入一个数字,查找该数字在数组中的下标。 如果找不到,返回-1
*/
int[] arr = {0,1,2,10,11,3,4,5,6,7,8,9};
Scanner in = new Scanner(System.in);
System.out.print("请输入一个数字:");
int num = in.nextInt();
/**
* 二分法查找
*/
int start = 0; // 默认起始坐标
int end = arr.length-1; // 默认结尾坐标
int index = -1; // 找不到默认index为-1
while(start<=end){
int middle = (start+end)/2; // 计算中间下标
if(num == arr[middle]){
index = middle;
break;
}
if(num > arr[middle]){
start = middle + 1;
}
if(num < arr[middle]){
end = middle - 1;
}
}
System.out.println(index);
in.close();
}