资源列表
yi
- 基本练习 你一定有用 复数包括实部虚部 输入输出-Basic exercises you must be useful to the plural include the real part of the imaginary part of the input and output
BSTree
- 二叉查找树的懒惰删除(lazy deletion) 包含类的完整定义-The lazy delete binary search tree (lazy deletion) contains a complete definition of the class
qpsk-modu
- QPSK 调至，基于BPSK的算法进行改进，实现了四项位调制，比原有调至方式更加准确无误-QPSK adjusted to improve the BPSK-based algorithm, to achieve the four bit modulation, and more accurate than the original adjusted
DArray
- 对任意维数，任意大小长度的数组的实现 。-For any number of dimensions, the realization of any size array.
precision--calculation
- ACM辅导资料，还有一些cdoj上的题目。模拟与高精度计算。-The ACM counseling information, there are some topics on cdoj. Analog with the precision of calculation.
select_sort
- /*选择排序 *从待排序的数中找到最小的元素，放到第一个位置， *从剩下的n - 1个元素中找到最小的元素，放到第二个位置， *依次下去，直到n - 1个元素。 *每次排序都会在待排序的元素中找出一个最小的值放到待排序的数的首段。 */-/* Sort select* find the smallest element from the number to be sorted, and placed in the first position, find the smalle
mp
- /*冒泡排序-----从大到小 *前一个和后一个两两比较，若小于则交换，直到最后一个元素，即小的冒泡，大的下沉 *每一循环都会从待排序的数中找出一个最小值，排到这组数据的最末端或首段，即冒泡 *对于n个数冒泡排序的最大趟数是n - 1,每一趟排序都会在这组待排序的数中产生一个最小值， */-/* Bubble sort----- from largest to smallest* before and after a twenty-two, if less than the ex
Word-frequency-analyzer
- 词频分析器。包含了文件读入功能。输入文本记录单词出现频率-Word frequency analyzer. Contains the file is read into function.
single_linked_list
- 用单链表实现对学生信息的管理，包括单链表的初始化，增添结点，删除节点，查找节点等功能-single linked list of student information management, including the initialization of the single linked list, add nodes, delete nodes, find the node functions
Quicksort
- 随机产生数进行快速排序，并记录了程序运行时间-Number of randomly generated quick sort and record the program run time
the-code-for-acmer-
- 这个代码是配套acm的黑书使用的，里面的源码准确，希望对各位acmer友帮助！-This code is used ACM supporting the black book, inside source accurately, hope you acmer friends help!
chained-binary-tree-algorithm
- 用C++实现链式二叉树的算法，有完整的可运行的程序。-The realize chained binary tree algorithm, using C++ complete operable program.