资源列表
DPG
- 堆排序 一、 需求分析 问题定义: 假设定义堆为满足如下性质的完全三叉树:(1)空树为堆;(2)根结点的值不小于所有子树根的值,且所有子树均为堆。编写利用上述定义的堆进行排序的算法,并分析推导算法的时间复杂度。 -a heap sort, demand analysis definition : the assumption that to meet the definition of sculpture, the complete nature of trigemi
2006121111111
- 此程序在运行的时候,产生一个子进程.此子进程每隔1秒钟,向父进程发送一个SIGUSR1信号,父进程收到信号后,打印当前系统时间.当经过10秒钟后,子进程结束运行,并发送SIGUSR2信号,通知父进程 父进程收到SIGUSR2信号后,退出.-this program in running time, have a child process. This process for every one seconds, father process to send a signal SIGUSR1 fa
Seg7
- FPGA Seg7七段顯示器模組副程式 Veliog -paragraph 107 Display module subroutines Veliog
04huffman_a
- 根据最常用的链表法进行huffman编码,可以手工预制权重,例如n=8的时候即可以在文件中写入,输出相应的编码结果-According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the c
qam
- 生成对称16QAM,64QAM,256QAM 星座图显示了幅度和相位
cssear
- 此程序用c语言实现凯撒密码,实现了加密算法-This procedure using c language Caesar password encryption algorithm achieved
cord
- c#编写的打印代码,用在AE和VS中。此文件来源http://faq.csdn.net/read/214404.html-print codes
yanghuisanjiao
- 杨辉三角的源程序,很不错的!!没有什么不可以,努力哈,加油-Yang Hui triangle of the source, very good! ! There is nothing wrong, to Kazakhstan, oil
PIDsuanfa
- 完善、正确的增量式PID源代码!已在相关项目中运用!-Complete and correct the incremental PID source code! Related projects to use!
tralightc
- c语言编写的模拟交通灯控制系统。要求区分主干道,通过感应支路是否有车的情况来控制路灯-c language simulation of traffic light control system. Requires the identification of the main road, slip by sensing whether there is a case to control street car
LinkQueue
- 2.4 线性表的应用举例 线性表的链式存储结构 线性表的顺序存储结构是指用一组连续的存储单元依次存储线性表中的每个数据元素。 -2.4 Application examples linear table storage structure linear form linear chain sequence table storage structure refers to a group of contiguous memory locations sequentially stor
kiushi2
- 编写C++程序完成以下功能:(1) 输入一个文本文件名(2) 使用ofstream 向一个二进制文件中输出各种类型的数据,并打开文件观察结果: 整数、无符号整型、长整型、浮点型、字符串、-The preparation of C++ Process is complete the following functions: (1) enter a text file name (2) ofstream to a binary file in the output of variou
