两种常用排序方式"插入法","冒泡"

// 插入法

 public String sort2(int[] idata) {
        int temp;
        for (int i = 0; i < idata.length; i++)
        {
            for(int j=i;(j>0) && (idata[j]<idata[j-1]);j--)
            {
            temp=idata[j-1];
            idata[j-1]=idata[j];
            idata[j]=temp;
          }
       }

        StringBuffer buff = new StringBuffer();
        for (int str4 : idata) {
            buff.append(str4 + " #");
        }
        return buff.toString();
    }

 

   // 冒泡法

    public String sort(int[] strArr) {

        int temp = 0;
        for (int i = 0; i < strArr.length - 1; i++) {

             for (int j = i; j < strArr.length; j++) {
                    if (strArr[i] > strArr[j]) {
                    temp = strArr[j];
                    strArr[j] = strArr[i];
                    strArr[i] = temp;
                }
            }
        }
        StringBuffer buff = new StringBuffer();
        for (int str3 : strArr) {
            buff.append(str3 + " ,");
        }
        return buff.toString();
    }