资源列表
dance_parter_code
- 数据结构舞伴问题,用单链表写的,有需要就拿去吧-Data structure partner issue, written in a single linked list
6.14Post-order-traversal
- 数据结构里，二叉树的后序遍历非递归算法。-Data structure, the binary tree postorder traversal non-recursive algorithm.
normalization
- SSD7. Provide your solution to the following in a file named normalization.txt. Note: The discussion in this exercise is independent of (i.e., completed unrelated to) the E-Commerce project described in the Appendix. The following table captures
source
- 线弹性模型，可以对一般的弹性体通过abaqus进行验证使用-Linear elastic model
student
- 面向对象C++中知识点多继承的一个应用实例-Object-oriented C++, an example of multiple inheritance, mainly comprising student class and its related base classes
tuxiaojin
- 线性表，我在大二的时候上数据结构时编的一个小程序。-linear table, I sophomores on the data structure of a series of small programs.
1047IntegerInquiry
- HDOJ 1047 One of the first users of BIT s new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers. ``This supercomputer is great, remarked Chip. ``I o
循环链表
- 数据结构中链表的算法,很好,可以运行循环链表.c
digits2alphabets
- Converts digits input to corresponding alphabetical value for example: for the input 2345670 the output will be twenty three lack fourty five thousand six hundred and seventy
inorder-tree
- In order tree using pointer and structure
200405165111
- 长整数的计算，用C实现，数据结构。是数据结构（严蔚敏）课后习题的实现。
Mai
- 八皇后问题，是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。计算机发明后，有多种方法可以解决此问题。-Eight queens problem is an ancient and well-known probl