资源列表
Desktop
- 使用线性表解决约瑟夫问题使用线性表解决约瑟夫问题-Use the linear table to solve the Joseph problemUse the linear table to solve the Joseph problem
Design-of-the-string-class
- 字符串类的设计与实现，包括使用堆分配存储表示实现字符串的存储，串赋值，串比较，求串长，串连接，求子串，清空子串操作-Design and implementation of the string class, including the use of heap-allocated memory representation for storage string, string assignment, string comparison, seeking string length, string
xiaoboquzao-yuyinxinhao
- 语音信号小波去噪 在小波基 db3 下进行一维离散小波反变换 对输出信号抽样点值进行归一化处理-Speech signal wavelet de-noising in wavelet bases ' db3' one-dimensional discrete wavelet transform on the output signal sample point value normalization
blink_led
- Blinking LED using PIC16F877A by assembly language
nasm-2.11.08
- NASM是一个为可移植性与模块化而设计的一个80x86的汇编器。NASM是一个自动配置的安装包，cd到它的目录下，输入./configuer,该脚本会找到最好的C编译器来构造NASM，并据此建立Makefiles-The Netwide Assembler (NASM) is an assembler and disassembler for the Intel x86 architecture. It can be used to write 16-bit, 32-bit (IA-32) an
yuesehuanwenti
- 约瑟夫环问题。本程序要求设编号为1-n的n(n>0)个人按顺时针方向围成一圈．首先第1个人从1开始顺时针报数．报m的人(m 为正整数)．令其出列。然后再从他的下一个人开始，重新从1顺时针报数，报m的人，再令其出列。如此下去，直到圈中所有人出列为止。-Josephus problem. The procedural requirements set numbered 1-n of n (n> 0) Personal clockwise circle. First 1st person
hash
- 散列表。它通过把关键码值映射到表中一个位置来访问记录，以加快查找的速度。这个映射函数叫做散列函数，存放记录的数组叫做散列表。在理想情况下，查找、插入、删除操作的时间均为O(1)，是一种高效的动态集合结构。-Hash table. It to access records by key value mapped to a table in a position to accelerate the lookup speed. This mapping function called a hash f
paixu
- 排序。当有 n 件任务同时来临时，每件任务需要用时ni，求让所有任务等待的时间和最小的任务处理顺序。-Sort. When there are n pieces tasks simultaneously comes when each task needs ni, seeking to make all the tasks waiting time and minimum of tasking order.
zuiduanlujin
- 最短路径。最短路径问题是图论研究中的一个经典算法问题， 旨在寻找图（由结点和边组成的）中两结点之间的最短路径。-The shortest path. The shortest path problem in graph theory is a classical algorithm issue, aimed at finding the shortest path diagram Two nodes (the nodes and edges) is between.
Web-Spider
- 图的遍历。若用有向网表示网页的链接网络，其中顶点表示某个网页，有向弧表示网页之间的链接关系。试设计一个网络蜘蛛系统，分别以广度优先和深度优先的策略抓取网页。-Graph traversal. If the web page to the network by indicating links network where vertices represent a page, there are links to the arcs represent the relationship between
priority-queue
- 优先级队列（priority queue）就是遵循两个排序规则的集合。首先，具有高优先级的项目在先。第二，具有相同优先级的项目使用先进先出方法来确定其排序。-Priority queue (priority queue) is to follow two collations set. First, a high-priority item first. Second, with the same priority projects using the FIFO method to determ
sizeyunsuan
- 四则运算表达式求值，将四则运算表达式用中缀表达式，然后转换为后缀表达式，并计算结果。-Four arithmetic expression uation, the four arithmetic expressions used in infix expression, and then converted to a postfix expression, and calculate the results.