資源簡介
二進制數相乘 分治法 C語言實現 優化了二進制的乘法 是的時間復雜度降低了
代碼片段和文件信息
#include?
#include?
#define??MAX_LEN???20
int?init(int?*Aint?*B)
{
int?in;
while(1==scanf(“%d“&n))
if(n?>?0)?break;
for(i=MAX_LEN-n;i? scanf(“%d“A+i);
for(i=MAX_LEN-n;i? scanf(“%d“B+i);
return?n;
}
void?bits_display(int?*Aint?n)
{
for(int?i=MAX_LEN-n;i printf(“%d“A[i]);
printf(“\n“);
}
int?bits_add(int?*Aint?*Bint?*Cint?n)
{
int?icarrylen;
for(i=MAX_LEN-1carry=0;i>=MAX_LEN-n;i--)
{
C[i]=A[i]+B[i]+carry;
if(C[i]?>=?2)
{
carry=1;
C[i]=C[i]%2;
}
else
carry=0;
}
len=n;
if(carry){?C[i]=carry;len++;}
return?len;
}
void?bits_sub(int?*Aint?*Bint?*Cint?n)
{//A>B?A-B
int?icarry;
for(i=MAX_LEN-1carry=0;i>=MAX_LEN-n;i--)
{
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件???????2446??2011-09-07?15:41??bits_muti\bits_multi.cpp
?????文件???????4321??2011-09-06?14:21??bits_muti\bits_muti.dsp
?????文件????????541??2011-09-06?14:15??bits_muti\bits_muti.dsw
?????文件??????41984??2011-09-07?15:41??bits_muti\bits_muti.ncb
?????文件??????49664??2011-09-07?15:41??bits_muti\bits_muti.opt
?????文件????????252??2011-09-07?15:41??bits_muti\bits_muti.plg
?????文件???????8455??2011-09-07?15:41??bits_muti\Debug\bits_multi.obj
?????文件?????172087??2011-09-07?15:41??bits_muti\Debug\bits_muti.exe
?????文件?????243476??2011-09-07?15:41??bits_muti\Debug\bits_muti.ilk
?????文件?????220264??2011-09-06?14:38??bits_muti\Debug\bits_muti.pch
?????文件?????451584??2011-09-07?15:41??bits_muti\Debug\bits_muti.pdb
?????文件??????33792??2011-09-07?15:41??bits_muti\Debug\vc60.idb
?????文件??????45056??2011-09-07?15:41??bits_muti\Debug\vc60.pdb
?????目錄??????????0??2011-09-07?15:41??bits_muti\Debug
?????目錄??????????0??2011-09-07?15:41??bits_muti
-----------?---------??----------?-----??----
??????????????1273922????????????????????15
- 上一篇:韋爾奇-鮑威爾著色算法C++實現
- 下一篇:aes加解密算法C語言實現
評論
共有 條評論