十进制 转 二进制

手工模拟除2取余法

#include <iostream>
using namespace std;

//除2取余法
bool Test(int nArray[], int nArrayCount, int nNum)
{
    if (nNum <= 0)
    {
        return false;
    }
    
    int i = nArrayCount - 1;
    while (true)
    {
        if (nNum == 0)
        {
            break;
        }
        nArray[i] = nNum % 2;
        nNum = nNum / 2;
        i--;
    }
    
    return true;
}

int main(int argc, char* argv[])
{
    int nArray[32] = {0};
    int n = 0;
    cout << "十进制 转 二进制" << endl;
    cin >> n;
    int nArrayCount = sizeof(nArray) / sizeof(nArray[0]);
    Test(nArray, nArrayCount, n);
    
    //输出
    for (int i = 0; i < nArrayCount; i++)
    {
        cout << nArray[i];
        if ((i + 1) % 4 == 0)
        {
            cout << " ";
        }
    }
    cout << endl;
    
    return 0;
}