目录:                                                                                                         


     1、插入排序算法伪码

     2、插入排序c++实现

     3、归并排序算法伪码

     4、归并排序c++实现

     5、总测试程序

  此链接为MIT算法导论第一讲详细笔记,感谢Sheridan

内容:                                                                                                          


        1、插入排序算法伪码  T(n) = Θ(n2)                 

             Insertion_sort(A[],n) //数组下标从1开始

                      for j <- 2 to n

                              do key <- A[j]

                               i <- j-1

                               while i>0 and A[i]>key

                                          A[i+1] <- A[i]

                                          i <- i-1

                              A[i+1]=key

 

       2、插入排序c++实现                

 1 template<typename T>
 2 void insertion_sort(vector<T> &A)
 3 {
 4     int i,j;
 5     T key;
 6     int len=A.size();
 7     for (j=1;j<len;j++)
 8     {
 9         i=j-1;
10         key=A[j];
11         while (i>=0&&A[i]>key)
12         {
13             A[i+1]=A[i];
14             i--;
15         }
16         A[i+1]=key;
17     }
18 }
View Code    

相关文章:

  • 2021-08-17
  • 2021-06-07
  • 2021-09-10
  • 2022-12-23
  • 2021-06-12
  • 2021-11-20
猜你喜欢
  • 2021-08-17
  • 2022-12-23
  • 2021-09-12
  • 2022-12-23
  • 2021-07-21
  • 2022-02-14
  • 2021-07-05
相关资源
相似解决方案