用java编写----int num[] = {12,3,45,5,67,78,0,1}; 排序 大到小，小到大

冒泡排序嘛，大学很经典的算法

package cn.javass.banksystem.bankuse.servicemgr.business.ebo;

import java.util.ArrayList;
import java.util.List;

public class Serviceebo {

public static void main(String args[])
{
Serviceebo serviceebo =new Serviceebo();

int[] array={12,3,45,5,67,78,0,1};

//从小到大排列并打印
int[] arrayNew=serviceebo.minOrMax(array,0);

for(int i=0;i<arrayNew.length;i++)
{
System.out.print(arrayNew[i]+" ");
}
System.out.println();
//从大到小排列并打印
int[] arrayNew1=serviceebo.minOrMax(array,1);

for(int i=0;i<arrayNew.length;i++)
{
System.out.print(arrayNew1[i]+" ");
}
}
public int[] minOrMax(int[] array1,int check)
{
int[] array;
int n;
if(check==0)
{
for(int i=0; i<array1.length;i++)
{
for(int j=i+1;j<arra