算法导论之Divide and conquer分治思想中的merge算法实现

最新推荐文章于 2023-06-07 13:57:36 发布

Victor__Zhang

最新推荐文章于 2023-06-07 13:57:36 发布

阅读量279

点赞数

分类专栏：算法导论文章标签：算法分治算法

本文链接：https://blog.csdn.net/soga235/article/details/106328435

版权

算法导论专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Rewrite the MERGE procedure so that it does not use sentinels, instead stopping once either array L or RR has had all its elements copied back to A and then copying the remainder of the other array back into A.（分治思想算法里的组合，不用最大定位值为无限大，可以采取的代码写法）

n1 = q - p + 1
n2 = r - q
create arrays L[1..n1] and R[1..n2]
for i = 1 to n1
  L[i] = A[p + i - 1]
for j = 1 to n2
  R[j] = A[q + j]
i = 1
j = 1
for k = p to r
  if i > n1
      A[k] = R[j]
      j = j + 1
  else if j > n2
      A[k] = L[i]
      i = i + 1
  else if L[i] ≤ R[j]
      A[k] = L[i]
      i = i + 1
  else
      A[k] = R[j]
      j = j + 1

添加链接描述