zoukankan      html  css  js  c++  java
  • 插入排序

    方法一:

    package com.wenzhi.util;
    
    import java.util.Arrays;
    
    public class Demo01 {
    
    	/**
    	 * 插入排序
    	 * @param args
    	 */
    	public static void main(String[] args) {
    		int ary[]=new int[]{ 69,60,78,90,76,85,98,64,66,82};
    		for(int i=0;i<ary.length;i++){	
    			i=ary[i];
    		}
    		System.out.println(Arrays.toString(ary));
    		System.out.println("插入排序");
    		for(int i=1;i<ary.length;i++){
    			int k=ary[i];
    			int j;
    			for(j= i-1;j>=0&&k<ary[j];j--){
    				ary[j+1]=ary[j];
    			}
    			ary[j+1]=k;
    			System.out.println(Arrays.toString(ary));
    		}
    		System.out.println("排序结束");
    		System.out.println(Arrays.toString(ary));
    	}
    
    }
    


    输出结果

    [69, 60, 78, 90, 76, 85, 98, 64, 66, 82]
    插入排序
    [60, 69, 78, 90, 76, 85, 98, 64, 66, 82]
    [60, 69, 78, 90, 76, 85, 98, 64, 66, 82]
    [60, 69, 78, 90, 76, 85, 98, 64, 66, 82]
    [60, 69, 76, 78, 90, 85, 98, 64, 66, 82]
    [60, 69, 76, 78, 85, 90, 98, 64, 66, 82]
    [60, 69, 76, 78, 85, 90, 98, 64, 66, 82]
    [60, 64, 69, 76, 78, 85, 90, 98, 66, 82]
    [60, 64, 66, 69, 76, 78, 85, 90, 98, 82]
    [60, 64, 66, 69, 76, 78, 82, 85, 90, 98]
    排序结束
    [60, 64, 66, 69, 76, 78, 82, 85, 90, 98]
    


    方法二:

    package com.wenzhi.util;
    
    import java.util.Arrays;
    import java.util.Random;
    
    public class Demo01 {
    
    	/**
    	 * 插入排序
    	 * @param args
    	 */
    	public static void main(String[] args) {
    		int ary[]=new int[12];
    		Random random=new Random();
    		for(int i=0;i<ary.length;i++){
    			ary[i]=random.nextInt(100);
    		}
    		System.out.println(Arrays.toString(ary));
    		System.out.println("插入排序");
    		for(int i=1;i<ary.length;i++){
    			int k=ary[i];
    			int j;
    			for(j= i-1;j>=0&&k<ary[j];j--){
    				ary[j+1]=ary[j];
    			}
    			ary[j+1]=k;
    			System.out.println(Arrays.toString(ary));
    		}
    		System.out.println("排序结束");
    		System.out.println(Arrays.toString(ary));
    	}
    
    }
    


    输出结果

    [54, 14, 75, 98, 67, 51, 98, 97, 54, 61, 27, 55]
    插入排序
    [14, 54, 75, 98, 67, 51, 98, 97, 54, 61, 27, 55]
    [14, 54, 75, 98, 67, 51, 98, 97, 54, 61, 27, 55]
    [14, 54, 75, 98, 67, 51, 98, 97, 54, 61, 27, 55]
    [14, 54, 67, 75, 98, 51, 98, 97, 54, 61, 27, 55]
    [14, 51, 54, 67, 75, 98, 98, 97, 54, 61, 27, 55]
    [14, 51, 54, 67, 75, 98, 98, 97, 54, 61, 27, 55]
    [14, 51, 54, 67, 75, 97, 98, 98, 54, 61, 27, 55]
    [14, 51, 54, 54, 67, 75, 97, 98, 98, 61, 27, 55]
    [14, 51, 54, 54, 61, 67, 75, 97, 98, 98, 27, 55]
    [14, 27, 51, 54, 54, 61, 67, 75, 97, 98, 98, 55]
    [14, 27, 51, 54, 54, 55, 61, 67, 75, 97, 98, 98]
    排序结束
    [14, 27, 51, 54, 54, 55, 61, 67, 75, 97, 98, 98]
    


  • 相关阅读:
    将不确定变为确定~接口应该是什么
    架构,改善程序复用性的设计~目录(附核心原代码)
    php实战第二十五天
    java一道简单的括号匹配问题
    屈原坐上神十带来了iOS 7
    《别独自用餐》 警句摘录
    php实战第二十四天
    偷了世界的程序员
    变故
    “快排”笔记
  • 原文地址:https://www.cnblogs.com/riasky/p/3464944.html
Copyright © 2011-2022 走看看