资源列表
3f
- 上传的都是一些导热的程序，而且都不一样。-conduct program
erchashu
- 二叉树各种操作的实验报告，希望共同学习进步-The experimental binary tree various operating report, hoping to learn together and progress
Circular-linked-list
- 一个动态循环链表报数游戏，报到数的退出直到剩下最后一个。运用到了动态构建循环链表，动态删除等，是我的一个课程作业_fromUSST-A dynamic circular linked list reported that the number of games, and to report the number of exit until the last remaining one. Use to dynamically build a circular linked list, dynami
sort
- 自己编写的几种经典的排序算法，里面有自己做的PPT详细讲解，希望有帮助吧-I have written several classic sorting algorithm, which own PPT explain in detail, I hope to help!
datastruct
- 自己写的程序，分别用C++和C实现的数据基本结构包括数组，链表，栈和队列，已经过测试，里面有详细的注释，希望与大家分享！-Write their own programs, basic data structures, including arrays, linked lists, stacks and queues respectively implemented in C++ and C, have been tested, there are detailed notes, I hope
hash
- hash开放式寻址,效率很高。修改自山东大学acm模板，可以直接处理负数和0，不必另作处理-hash open addressing, very efficient. Modified from Shandong University acm template, you can deal directly with negative numbers and 0, and do not have to be dealt with separately
rmq
- 经典RMQ问题，用来实现区间最大值和最小值的统计，预处理时间nlogn,查询时间O(1)-Classic the RMQ question, is used to achieve the interval maximum value and the minimum statistics, pretreatment time nlogn, query time O (1)
2-sat
- 所为2-sat问题，就是2判断问题。该算法是用拆点的方式建图，用找强连通子图的方法推出矛盾，用以判断2-sat是否可行。经典实现，-2-sat, is a matter of judgment. The algorithm is used to find a demolition point built strongly connected subgraph launched contradictions, used to determine whether the 2-sat. Classic
sort
- 内部排序算法，快速排序，归并排序算法实现。随即生成的100个数字自动排序-Internal sorting algorithms quick sort, merge sort algorithm. 100 randomly generated digital automatic sorting
acm
- acm上海交大模板 useful template for acm-template for acm
seisView
- UNIX下地震培面显示软件包，有各种变换的代码，可用于参考-UNIX under earthquake Pei surface display package, various transform code, can be used for reference
polynomial-multiplication
- 可以实现两个一元多项式相乘，并且能够把两个多项式及结果输出，的算法代码-Can achieve two unary polynomial multiplied, and be able to put two polynomials and the resulting output of the algorithm code