data structure

简单快速排序，简单快速排序，简单快速排序，简单快速排序。(Simple and quick sort, simple and quick sort, simple and quick sort, simple and quick sort.)

mc145158控制参考C程序 多版本参考C程序 汇编程序等,可以说比较全面 单片机控制mc145158频率合成器汇编源程序(Mc145158 control reference C program multi-version reference C program assembler, etc., can be said that more comprehensive single-chip control mc145158 frequency synthesizer assembly source)

数字图像隐藏及提取研究分析论文、文献等。主要研究算法为LSB算法和DCT奇偶量化、DCT均值量化。(Digital Image Information Hiding and Extraction of analytical papers, literature. The main algorithm for the LSB algorithm and DCT parity quantization, DCT mean quantization.)

基于iCore2双核心板，用stm32和W5300实现以太网模块通讯。软件代码包括stm32驱动和Qt 程序。(Based iCore2 dual core board, with stm32 and W5300 Ethernet module communication. Stm32 drivers and software code, including Qt programs.)

基于元胞自动机的交通流模型 ns模型 C++(ns model, C++)

上传和下载文件，适用与教师管理课件。 不错的，值得下载来-upload and download files, application management and teachers courseware. Well, it is worth downloading to see! !

说明：  首先说明ADS1158命令读写模式，然后解析命令含义及配置顺序等。(First, the ADS1158 command read and write mode, and then parse the command meaning and configuration order and so on.)

C#写的中国象棋源码，供初学者参考学习，界面较为简陋，见笑-C# Written in Chinese chess source, the reference for beginners to learn, the interface is more primitive, a laughing stock

说明：  本文档为小波降噪与神经网络算法的代码程序，基于matlab(Wavelet and neural network algorithm program)

Public Bike Management   (20分) There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and return it to any other stations in the city. The Public Bike Management Center (PBMC) keeps monitoring the real-time capacity of all the stations. A station is said to be in perfect condition if it is exactly half-full. If a station is full or empty, PBMC will collect or send bikes to adjust the condition of that station to perfect. And more, all the stations on the way will be adjusted as well. When a problem station is reported, PBMC will always choose the shortest path to reach th