稳定的直接插入排序
基本思想:
我们将一个待排序序列分为有序区和无序区（一般开始的时候将第一个元素作为有序区，剩下的元素作为无序区），每次将无序区的第一个元素作为待插入记录，按大小插入到前面已经排好的有序区中的适当位置，直到记录全部插入完成为止。(如果待插入的元素与有序序列中的某个元素相等，则将待插入元素插入到相等元素的后面)
ACM入门（占个位）
A+B for Input-Output Practice(using C++)
1.
| Problem Description |
|---|
| Your task is to Calculate a + b. Too easy?! Of course! I specially designed the problem for acm beginners. You must have found that some problems have the same titles with this one, yes, all these problems were designed for the same aim |
| Input |
| The input will consist of a series of pairs of integers a and b, separated by a space, one pair of integers per line. |
| Output |
| For each pair of input integers a and b you should output the sum of a and b in one line, and with one line of output for each line in input. |
| Sample Input |
| 1 6 1 20 |
| Sample Output |
| 7 21 |