BB8F93的专栏

#include#includeusing namespace std;void  merge(vector &va, int p, int q, int r){ int n1 = q - p + 1; int n2 = r - q; vector L(n1+1); vector R(n2+1); for( int i = 0; i  {  L[i] = va[p + i]; } fo

 求平方根常用的算法为牛顿逐步逼近方法:       例如,求2的平方根:           猜测                          商                           平均值                                          1                                     2/1 = 2      

                   插入排序算法      插入排序(即原地排序)输入:n个数（a1, a2, a3, ... an）.输出：输入序列的重新排序（a1, a2, a3... an）.   c++描述：#include using namespace std;void main(){ int J_Array[9] = { 3, 8, 23, 89, 1, 3