![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
文章平均质量分 77
gwindm
android
汇编
C/C
VC ;MFC;
ASP.NET(C#)
SQL Server2000
s57
展开
-
冒泡排序
#include using namespace std;void main(){ int d[10] = {34,3,2,12,4,53,2,53,2,12}; int temp = 0; for(int i=0; i< 8; i++) { for(int j= i+1; j< 9; j++) { if(d[i] > d[j]) {原创 2009-03-09 09:16:00 · 146 阅读 · 0 评论 -
赫夫曼编码
#include #include #include typedef struct { unsigned int weight; unsigned int parent, lchild, rchild;}HTNode, *HuffmanTree;typedef char * * HuffmanCode;void Select(HuffmanTree, int,原创 2009-07-01 14:46:00 · 233 阅读 · 0 评论