-
1013_digital_root
数字根算法,用最简单的代码计算数字根。如果把一个大数的各位数字相加得到一个和,再把这个和的各位数字相加又得一个和,再继续作数字和,直到最后的数字和是个位数为止,这最后的数称为最初那个数的“数字根”。(Digital root algorithm, with the most simple code to calculate the digital root. If you figure in a large numbers is the sum of a, then this and you figure the sum is again a, and then continue for digital and until the final figure and the single digits, the last number called initially that the number of "digital root".)
- 2012-04-27 10:07:18下载
- 积分:1
-
eightqueen
利用數據結構中的棧,實現19世紀著名數學家高斯提出的八皇后問題(Stack data structure, to achieve the eight queens problem of the 19th century, the famous mathematician Gauss)
- 2012-10-23 08:30:21下载
- 积分:1
-
有向图的邻接表存储的实现graph
有向图的邻接表存储的实现,包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)
- 2020-07-16 10:38:50下载
- 积分:1
-
sort
自己编写的几种经典的排序算法,里面有自己做的PPT详细讲解,希望有帮助吧(I have written several classic sorting algorithm, which own PPT explain in detail, I hope to help!)
- 2012-08-28 09:31:28下载
- 积分:1
-
Data-structure-diagram
数据结构中图的存储结构的建立与搜索
建立图的二种存储结构
在不同的结构上实现遍历
(Data structure diagram of the storage structure of the establishment of the search to establish two kinds of graph storage structure in the different structures to achieve through)
- 2011-06-27 09:29:40下载
- 积分:1
-
5-source--code-of-DS--PRO
数据结构课上老师布置的5个小项目的源代码,分别是汽车过河,一元多项式,迷宫,日历,BFS_DFS(failed to translate)
- 2011-05-18 17:01:17下载
- 积分:1
-
Work3.5
上海交通大学数据结构课程的课后作业系列3.5:仅供参考,最好还是自己去写(Shanghai Jiaotong University data structure course homework Series 3.5: for reference, it is best to write their own)
- 2013-12-27 21:00:03下载
- 积分:1
-
kruscal_Primspanningtree
最小生成树两种经典算法,kruscal和Prim算法(spanning tree)
- 2010-07-14 10:10:54下载
- 积分:1
-
shizuo
用哈夫曼编码的方式进行图像的压缩,其中定义了一个cdib的类,通过之类来对图像进行处理(image coding in haffman)
- 2012-04-27 18:37:47下载
- 积分:1
-
tree
二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
- 2013-07-09 13:39:31下载
- 积分:1