package org.simple.sort;
public class ChooseSort {
private int[] chooses;
private int element;
public ChooseSort() {
}
public ChooseSort(int max) {
chooses=new int[max];
element=0;
}
public void insert(int data){
chooses[element]=data;
element++;
}
public void display(){
for (int i = 0; i < chooses.length; i++) {
System.out.print(chooses[i]+",");
}
System.out.println("");
}
//选择排序
public void choose(){
for (int i = 0; i < chooses.length; i++) {
for (int j = 0; j < chooses.length; j++) {
if(chooses[i]<chooses[j]){
int temp=chooses[i];
chooses[i]=chooses[j];
chooses[j]=temp;
}
}
}
}
public static void main(String[] args) {
ChooseSort c=new ChooseSort(7);
c.insert(34);
c.insert(2);
c.insert(66);
c.insert(88);
c.insert(44);
c.insert(11);
c.insert(77);
c.display();
c.choose();
c.display();
}
}