一:排序
1:冒泡排序
相邻元素两两比较,大的往后放,第一次完毕,最大值出现在了最大索引处
//冒泡排序
public class ArrayDemo {
public static void main(String[] args) {
int array [] = {21,32,98,11,23};
System.out.println("原数组:");
printarray(array);//遍历输出原数组
System.out.println("排序后的数组:");
sort(array);
printarray(array);
}
public static void sort(int[] array) {
// TODO Auto-generated method stub
for(int i = 0;i < array.length - 1;i++){
for(int j = 0;j < array.length - 1 - i;j++){
if(array[j] > array[j + 1]){//相邻两个数进行比较
int number = array[j];
array[j] = array[j + 1];
array[j + 1] = number;
}
}
}
}
public static void printarray(int array []) {
// TODO Auto-generated method stub
System.out.print("[ ");
for(int i = 0;i < array.length;i++){
if(i == array.length -1)
System.out.print(array[i] + " ]");
else
System.out.print(array[i] + " ");
}
System.out.println();
}
}
2:选择排序
从0索引开始,依次和后面元素比较,小的往前放,第一次完毕,最小值出现在了最小索引处
//选择排序
public class ArrayDemo1 {
public static void main(String[] args) {
int array [] = {21,32,98,11,23};
System.out.println("原数组:");
printarray(array);//遍历输出原数组
System.out.println("排序后的数组:");
sort(array);
printarray(array);
}
public static void sort(int[] array) {
// TODO Auto-generated method stub
for(int i = 0; i < array.length - 1 ;i++){
for(int j = i + 1 ;j < array.length ;j++){
if(array[i] > array[j]){//第一个数分别和后面的数进行比较
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
}
}
}
public static void printarray(int array []) {
// TODO Auto-generated method stub
System.out.print("[ ");
for(int i = 0;i < array.length;i++){
if(i == array.length -1)
System.out.print(array[i] + " ]");
else
System.out.print(array[i] + " ");
}
System.out.println();
}
}
二:查找
基本查找 数组元素无序
二分查找 数组元素有序
//二分查找
import java.util.Scanner;
public class ArrayDemo3 {
public static void main(String[] args) {
int[] arr = {11,22,33,44,56,67};
Scanner sc = new Scanner(System.in);
System.out.println("请输入要查找的数字:");
int value = sc.nextInt();
int index = getIndex(arr,value);
System.out.println(value+"的索引位置是:"+index);
}
public static int getIndex(int[] arr,int value) {
int max = arr.length - 1;
int min = 0;
int mid = (max + min) / 2 ;
while(arr[mid] != value){
if(value > arr[mid]){
min = mid + 1;
}
else if(value < arr[mid]){
max = mid - 1;
}
if(min > max){//此处是重点,难理解,可以举例用debug调试(value = 22)
return -1;
}
mid = (max + min)/2;
}
return mid;
}
}