qw2552479的专栏

public void selectSort(int[] array, String sortType){ if("asc".equals(sortType)){//正序 for(int i = 1;i<array.length;i++){ int index = 0; for(int j=1;j<=array.length-i;j++){ if(array[j]>ar

验证出牌是否符合规则时，牌必须是排好序的首先Card类，int value;//卡牌大小 int cardValue;//卡牌序号:0-53 boolean isChoose;public class Card { int value;//卡牌大小 int cardValue;//卡牌序号:0-53 boolean isChoose; //A 1 14 27 40 //2 2

public void binarySort(int[] array) { for (int i = 1; i < array.length; i++) { int temp = array[i]; int beginIndex = 0; int endIndex = i - 1; while (beginIndex <= endIndex) {

非递归方法 public int binarySearch_asc(int[] array, int data) {//正序列查找 int beginIndex = 0; int endIndex = array.length - 1; int midIndex = -1; if (data endIndex || data > array[endIndex]) {

public void quickSort_asc(int[] array , int low , int high){ int i , j , x ; if(low < high){//结束循环 i = low ; j = high ; x = array[low];//将第一个数作为中轴 while( i < j ){ while( i x){ j--;

public void insertSort(int[] array, String sortType){ if("asc".equals(sortType)){ for(int i = 1;i<array.length;i++){ int j; int temp = array[i]; for(int j = i;j>0 && array[j-1]>temp;j--){

public void bubbleSort(int[] array , String sortType){ if("asc".equals(sortType)){ for(int i = 1;i<array.length;i++){ for(int j = 0;j<array.length-i;j++){ if(array[j]>array[j+1]){ swap(