insertion-sort

最新推荐文章于 2025-09-11 00:00:00 发布

原创最新推荐文章于 2025-09-11 00:00:00 发布 · 665 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java #sort

algorithm 专栏收录该内容

5 篇文章

订阅专栏

本文详细介绍了插入排序算法的核心思想及其实现步骤，通过逐步比较并移动元素到合适位置完成排序过程。文章提供了Java语言实现的示例代码，并指出其时间复杂度为O(n²)。

The core idea of the insertion sort is to place an element in the appropriate location in the array.

The detail steps of this algorithm are as follows:

1. Choose an element from left to right, and in particular, you have to start your traversal from the second element.

2. Compare the element you had chosen at the first step with those elements at the front of it.

3. Put the element to the appropriate location.

4. Loop next element until the last.

Its time complexity is O(n²).

The following is the implementation of insertion-sort by java.

public void insertionSort(){
    int[] A = {4,5,3,2,7,5,8};
    for(int j = 1;j < A.length;j++){
        int key = A[j];
        int i = j - 1;
        while(i >= 0 && A[i]> key){
            A[i+1] = A[i];
            i = i - 1;
        }
        A[i+1] = key;
    }
}