算法 ----- 插入排序(INSERTION_SORT)
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
for (int i = 1; i < INSERTION_SORT.Length; i++) { int temp = INSERTION_SORT[i]; while (i>0 && INSERTION_SORT[i - 1] > INSERTION_SORT[i]) { INSERTION_SORT[i] = INSERTION_SORT[i - 1]; INSERTION_SORT[i - 1] = temp; i--; } }
posted on 2013-10-15 16:40 Demon Edge 阅读(220) 评论(0) 编辑 收藏 举报