2018 ACM/ICPC 沈阳站 C Insertion Sort
版权声明：欢迎转载，请注明此博客地址。 https://blog.csdn.net/Ever_glow/article/details/84228482 题目描述 Insertion sort is a simple sorting algorithm that builds the final sorted array one item at an iteration. More precisely, insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. At each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain. This type of sorting is typically done in-place, by iterating up the array, growing the sorted