- package com.eshore.sweetop.sort;
- import java.util.Arrays;
- public class Bubble {
- public static void sort(int[] a,boolean reverse){
- for (int i = 0; i < a.length-1; i++) {
- for (int j = i+1; j < a.length; j++) {
- if(reverse^(a[j]<a[j-1])){
- a[j]^=a[j-1];
- a[j-1]^=a[j];
- a[j]^=a[j-1];
- }
- }
- }
- }
- public static void sort(int[] a){
- sort(a,false);
- }
- public static void main(String[] args) {
- int[] a={2,5,3,7,6,8};
- sort(a);
- System.out.println(Arrays.toString(a));
- }
- }