exercises2.1-4 of introduction to Algorithms

二进制加法算法

转载于 2013-01-13 17:07:00 发布 · 57 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/jianboqi/archive/2013/01/13/2858592.html

文章标签：

#c/c++

本文介绍了一种用于计算两个n位二进制整数相加的算法，并提供了伪代码及C++实现代码。该算法将两个二进制整数存储在两个n元素的数组中，并将它们的和以二进制形式存储在一个(n+1)元素的数组里。

Consider the problem of adding two n-bit binary integers, stored in two n-element arrays A and B. The sum of the two integers should be stored in binary form in the an (n+1) -element array C. State the problem formally and write pseudocode for adding the two integers.

[Pseudocode]

Adding-A-B(A,B,C)
     key = 0
     for i = 1 to n
          sum = A[i] + B[i] +key
          C[i] = sum % 2
          key = sum / 2
      C[n+1] = key

[C++ Code]

void ex_2_1_4(int A[],int b[],int C[],int n)
{
    int key = 0;
    int sum = 0;
    for (int i=0;i<n;i++)
    {
        sum = A[i] + b[i] + key;
        C[i] = sum % 2;
        key = sum / 2;
    }
    C[i] =  key;
}