递归求数组最大值java,java - 冒泡加递归 求数组最小值

// 冒泡求数组最小值

public class Bubble {

// 定义存储最小值的变量

static int min;

public static void main(String[] args) {

int[] arr;

arr = new int[]{10,200,66,1,0};

min = arr[0];

Bubble Max = new Bubble();

Max.getMin(arr,0);

System.out.println("最小值 ===== "+min);

}

void getMin(int[] arr,int index){

if(index

if(index

compare(arr[index],arr[index+1]);

}

getMin(arr,index+1);

}else{

return;

}

}

static void compare(int one,int two){

if(one

if(one

min = one;

}

}else{

if(two

min = two;

}

}

}

}

标签：arr,java,min,int,最小值,冒泡,getMin,Bubble

来源： https://www.cnblogs.com/500m/p/13670140.html