kuaishupaixu.java

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

import javax.swing.JOptionPane;
public class kuaishupaixu{
public static void main(String[] args) {
  	String LengthString=JOptionPane.showInputDialog(null,"输入字符串长度:","Length:",JOptionPane.QUESTION_MESSAGE); 
    int a=Integer.parseInt(LengthString);
    int[] number=new int[a];
    for(int b=0;b<a;b++)
    {
    String NumberString=JOptionPane.showInputDialog(null,"输入字符:","Number:",JOptionPane.QUESTION_MESSAGE); 
    int c=Integer.parseInt(NumberString);
    number[b]=c;	
    }
    String s1=" ";
    for(int k=0;k<number.length;k++){
          s1=s1+" "+number[k];
        }
   JOptionPane.showMessageDialog(null,s1,"输入的字符串:",JOptionPane.INFORMATION_MESSAGE);
   sort(number);
  }
  
  
  
  public static void sort(int[] number) {
     quicksort(number,0,number.length-1);
  }
 
 
  private static void quicksort(int[] number,int left,int right) 
     {  
       if(left < right) {             
         int q = partition(number, left, right);         
         quicksort(number, left, q-1);  
            printArray(number);
         quicksort(number, q+1, right);      
            printArray(number);
       }   
     }  
     	
     	
     private static int partition(int[] number,int left, int right) 
     {       
       int s = number[right];  //先以右边最后一个为轴      
       int i = left-1;        
       for(int j = left; j < right; j++) 
       {    if(number[j] <= s) 
            {    i++;       
              swap(number, i, j);     
            }       
          }         
          swap(number, i+1, right); 
          return i+1;     
       }  
       	
       	
    private static void swap(int[] number, int i, int j) {
    int t;
    t=number[i];
    number[i]=number[j];
    number[j]=t;
  }  
    
  
  public static void printArray(int[] number) {
  String s=" ";
  for(int k=0 ;k<number.length;k++){
         s=s+" "+number[k];
         }
  JOptionPane.showMessageDialog(null,s,"快速排序后的字符串:",JOptionPane.INFORMATION_MESSAGE);
  }
  
 
}