用户注册



邮箱:

密码:

用户登录


邮箱:

密码:
记住登录一个月忘记密码?

发表随想


还能输入:200字
云代码 - java代码库

插入排序- 基于原数组排序

2013-07-31 作者: 中国人在美国举报

[java]代码库

package insertionSort;
import java.util.Arrays;
public class TestInsertionSort {
 
    public static void main(String[] args) {
        int[] arr = {3,4,9,7,1,2,2,1,6,8,5};
        System.out.println("The unsorted order arrays is : "+Arrays.toString(arr));
        System.out.println("Algorithm directInsertaionSort  - the sorted order arrays is : "+Arrays.toString(InsertionSortImpl.directInsertaionSort(arr)));
    }
 
}
 
package insertionSort;
 
public class InsertionSortImpl {
 
    public static int[] directInsertaionSort(int arr[]) {
        int len = arr.length;
        int temp;
        int positionMark = -1;
        for (int i = 1; i < len; i++) {
            temp = arr[i];
            for (int j = i - 1; j >= 0; j--) {
                if (temp < arr[j]) {
                    arr[j + 1] = arr[j];
                    positionMark = j;
                }else{
                    break;
                }
            }
 
            if (positionMark != -1) {
                arr[positionMark] = temp;
                positionMark = -1;
            }
        }
        return arr;
    }
 
}
 
 
/***运行结果:
 
The unsorted order arrays is : [3, 4, 9, 7, 1, 2, 2, 1, 6, 8, 5]
Algorithm directInsertaionSort  - the sorted order arrays is : [1, 1, 2, 2, 3, 4, 5, 6, 7, 8, 9]
 
****/


网友评论    (发表评论)


发表评论:

评论须知:

  • 1、评论每次加2分,每天上限为30;
  • 2、请文明用语,共同创建干净的技术交流环境;
  • 3、若被发现提交非法信息,评论将会被删除,并且给予扣分处理,严重者给予封号处理;
  • 4、请勿发布广告信息或其他无关评论,否则将会删除评论并扣分,严重者给予封号处理。


扫码下载

加载中,请稍后...

输入口令后可复制整站源码

加载中,请稍后...