最近在搞算法,回想起之前学的冒泡排序,感觉还有很多可以优化的地方,我就试着优化了一下,顺便把最近学的Java运用进去,话不多说,直接上代码。
public class bubble_sort {
private int[] a;
private int n;
public int[] getA() {
return a;
}
public void setA(int[] a) {
this.a = a;
}
public int getN() {
return n;
}
public void setN(int n) {
this.n = n;
}
// 构造器,创建对象时顺带给n赋值
public bubble_sort(int n) {
this.n = n;
}
public int bubblesort() {
int sw = 0;
boolean flag = true;
for (int i = 0; flag; i++) {
flag = false;
for (int j = 0; j < a.length - i - 1; j++) {
if (a[j] > a[j + 1]) {
int t = a[j];
a[j] = a[j + 1];
a[j + 1] = t;
flag = true;
sw++;
}
}
}
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
System.out.println();
return sw;
}
public int[] input() {
Scanner scan = new Scanner(System.in);
int array[] = new int[n];
for (int i = 0; i < n; i++) {
array[i] = scan.nextInt();
}
return array;
}
}
public class Textbubblesort {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
bubble_sort p = new bubble_sort(scan.nextInt());
p.setA(p.input());
int s = p.bubblesort();
System.out.println(s);
}
}
运行结果如下:
- 新手写的,可能不是最优解,但勉强解决了问题,如果感到对你有所帮助,点个赞吧!!!
祝你幸福!