资源列表
1106
- 我的代码有关如何正确的计算a^b的最后一位-My code on the proper calculation of a ^ b the last
Bellman-ford
- 单源最短路径,bellman_ford算法,邻接阵形式,复杂度O(n^3)-Single-source shortest path, bellman_ford algorithm, adjacency matrix form, the complexity of O (n ^ 3)
jiudinizhi
- 数据结构实验，对链表中的数据进行就地逆置。-Experimental data structure of linked list data in place against the home.
bitree
- 数据结构二叉树源程序，对学习数据结构的人了解使用，帮助了解书上的内容，非常适用-Source binary tree data structure, data structure for learning about the use of people, to help understand the contents of the book is very suitable
MACObj
- Generate MAC and digest data
SequentialQuickMergeBubbleSort
- In this code there are algorithms for sequential sorting like Quick Sort,Merge,Bubble,Insertion written in c++.
Colored-Sticks
- 北京大学ACM/ICPC竞赛队 2009 PKU ACM/ICPC Trainning 14 Colored Sticks F:Colored Sticks 时间限制: 5000ms 内存限制: 65536kB 描述 You are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to ali
delete
- 非递减有序的顺序表中插入一个值为X的元素，使插入后的表仍然为非递减有序链表。-The establishment of the sequence table, insert, and delete
Josephus
- 约瑟夫环的循环链表的方法 用了单链表和双链表-Josephus circular linked list with a single linked list and doubly linked list
erchashu
- 利用java 实现 二叉树算法，自己编写的利用java 实现 二叉树算法 -Java data structures singly linked lists of simple implementation
cengcibianli
- 运用层次遍历的方法输出从根节点到每个叶子节点的逆-The method of using traverse the level output the root to each leaf node inverse