zifupaixu.java

算法分析实验 java实现： 有： 公约数 合并算法 字符排序 快速排序 马踏棋盘问题 马踏棋盘问题（文本做法） 折半查找 最大子段和

import javax.swing.JOptionPane;
public class zifupaixu {
  public static void main(String args[]){
  	String zifuString=JOptionPane.showInputDialog(null,"请输入一个字符串:","字符串合并排序-输入",JOptionPane.QUESTION_MESSAGE);
    //String  zifu=String.parseStr(zifuString);
    String output="输入的字符串：\n"+
    	           zifuString+"\n"+
    	           "排序后的字符串：\n"+
    	           sort(zifuString); 
     JOptionPane.showMessageDialog(null,output,"字符串合并排序--输出",JOptionPane.INFORMATION_MESSAGE);
  //  JOptionPane.showMessageDialog(null,sort(zifuString),"字符串合并排序--输出",JOptionPane.INFORMATION_MESSAGE);
    //System.out.println(sort(zifuString));
    //System.out.println(sort("abcABDs"));
  }

  public static String sort(String s) {
    StringBuffer buffer = new StringBuffer(s);

    char currentMax;
    int currentMaxIndex;

    for (int i=buffer.length() - 1; i >= 1; i--) {
      // Find the maximum in the buffer[0..i]
      currentMax = buffer.charAt(i);
      currentMaxIndex = i;

      for (int j = i - 1; j >= 0; j--) {
        if (currentMax < buffer.charAt(j)) {
          currentMax = buffer.charAt(j);
          currentMaxIndex = j;
        }
      }

      // Swap buffer.charAt(i) with buffer[currentMaxIndex] if necessary;
      if (currentMaxIndex != i) {
        buffer.setCharAt(currentMaxIndex, buffer.charAt(i));
        buffer.setCharAt(i, currentMax);
      }
    }

    return buffer.toString();
  }
}