算法之简单排序

insertionsort(data[])
    for  i = 1  to data.length - 1
       tmp = data[i];
       将所有大于tmp的元素data[j]向后移动一位;
       将tmp放在正确的位置上;

def insertion_sort(a)
  i = 1
   while  i < a . length
    tmp = a[i]
    j = i
     while  j > 0
      break  if  tmp > a[j - 1 ]
      a[j] = a[j - 1 ]
      j -= 1
    end
    a[j] = tmp
    i += 1
  end
end       
a = [ 10 , 2 , 3 ]
insertion_sort(a)
a . each { | i  |   print  i . to_s + "   " }

package  com.sohu.blog.denns_zane.sort;

public   class  InsertSort {
    public static void main(String args[]){
        int []data={12,2,3,56,90};
        insertsort(data);
        for(int i=0;i<data.length;i++){
            System.out.print(data[i]+" ");
        }
    }
    public static void insertsort(int []data){
        for(int i=1,j;i<data.length;i++){
            int tmp=data[i];
            for(j=i;j>0&&tmp<data[j-1];j--)
               data[j]=data[j-1];
            data[j]=tmp;   
        }
    }
}

selectionsort(data[])
      for  i = 0  to data.length - 2
        从data[i],,data[n - 1 ]中选取最小的元素
        将它和data[i]交换

def selection_sort(a)
  least = 0
   for  i in ( 0 .. (a . length - 2 ))
    j = i + 1
    least = i
     while  j < a . length
       if  a[j] < a[least]
        least = j
      end
      j += 1   
    end
    a[least] , a[i] = a[i] , a[least]  unless  least == i  # 交换
  end
end
a = [ 12 , 4 , 34 , 23 , 45 , 35 ]
selection_sort(a)
a . each { | i |   print  i . to_s + "   " }

package  com . sohu . blog . denns_zane . sort ;

public class SelectionSort{
    public static  int [] selection_sort( int  [] data){
         int  i , j , least = 0 ;
         for (i = 0 ;i < data . length - 1 ;i ++ ){
        
           for (j = i + 1 , least = i;j < data . length ;j ++ )
             if  (data[j] <= data[least])
                    least = j;
           if  (least != i)
            swap(data , least , i);   // ½»»»data[i]ºÍ×îСԪËØ
        }    
         return  data;   
    }
    public static void swap( int []data , int  least , int  i){
         int  tmp = data[least];
        data[least] = data[i];
        data[i] = tmp;
    }
    public static void main(String args[]){
         int [] t = { 10 , 29 , 12 , 23 , 56 };
        selection_sort(t);
         for ( int  i : t){
             System . out . print (i + "   " );
        } 
    }
}

bubblesort(data[])
   for  i = 0  to data.length - 2
      for  j = data.length - 1  downto i + 1
         如果顺序错误，就交换j和j - 1位置上的元素

def bubble_sort(data)
   for  i in ( 0 .. (data . length - 2 ))
     j = data . length - 1
      while  j > i
         if  data[j] < data[j - 1 ]
           data[j] , data[j - 1 ] = data[j - 1 ] , data[j]    # 交换
        end
        j -= 1
     end
  end
end
a = [ 12 , 3 , 56 , 7 , 89 , 87 ]
bubble_sort(a)
a . each { | i |   print  i . to_s + "   " }

package  com.sohu.blog.denns_zane.sort;

public   class  BubbleSort {
    public static void bubble_sort(int [] data){
        for(int i=0;i<data.length-1;i++)
            for(int j=data.length-1;j>i;j--)
              if(data[j]<data[j-1])
                swap(data,j,j-1);
        
    }
    public static void swap(int[]data,int least,int i){
        int tmp=data[least];
        data[least]=data[i];
        data[i]=tmp;
    }
    public static void main(String args[]){
        int[] t={10,29,12,23,56};
        bubble_sort(t);
        for(int i:t){
            System.out.print(i+" ");
        } 
    }
}