Insertion sort algorithm

最新推荐文章于 2024-09-05 17:49:38 发布

citylove

最新推荐文章于 2024-09-05 17:49:38 发布

阅读量898

点赞数

CC 4.0 BY-SA版权

分类专栏： my work 文章标签： algorithm numbers sorting delete input each

本文链接：https://blog.youkuaiyun.com/citylove/article/details/6362823

my work 专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种适合小规模数据排序的高效算法——插入排序，并通过示例详细展示了其操作过程。该算法的时间复杂度为O(n²)，适用于教育场景及小规模数据集的排序任务。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Insertion sort is an efficient algorithm for sorting a small number of elements, which costs O(n²).

The operation of INSERTION-SORT on the array A = 〈5, 2, 4, 6, 1, 3〉. Array indices appear above the rectangles, and values stored in the array positions appear within the rectangles. (a)-(e) The iterations of the for loop of lines 1-8. In each iteration, the black rectangle holds the key taken from A[j], which is compared with the values in shaded rectangles to its left in the test of line 5. Shaded arrows show array values moved one position to the right in line 6, and black arrows indicate where the key is moved to in line 8. (f) The final sorted array.

#include <iostream> using namespace std; int main() { int size; //determine the size of the array cout<<"determine the size of array: "; cin>>size; int *array = new int[size]; int i,j,key; cout<<"input numbers: "; //input the numbers that will be sorted for(i=0;i<size;i++) cin>>array[i]; cout<<endl; for(j=1;j<size;j++) //use the insertion sort algorithm to sort the array { key=array[j]; i=j-1; while(i>=0&&array[i]>key) { array[i+1]=array[i]; i--; } array[i+1]=key; } cout<<"sorted array is displayed below: "; //output the sorted array for(i=0;i<size;i++) { cout<<array[i]<<" "; } delete [] array; }