算法分析实验报告：Strassen矩阵乘法，无问题

获取DLL中的版本信息(主版本号,次版本号等)-DLL to obtain the version information (major version number, sub-version number, etc.)

wince 5.0 MFC EVC 4.0应用程序-wince 5.0 MFC EVC 4.0 application

语音的编解码程序,2.4kb/s 低速率  MELP  语音编码 包含编解码部分 附带有 语音编码中参数（基音周期，LSF， 子带强度）的输出

INA128和INA129是低功耗高精度的通用仪表放大器-INA128/INA129DATASHEET

一个采用B-树数据结构制作的图书馆管理程序，功能较简单，适合大学生数据结构参考使用-use a B-tree data structures produced by the library management procedures and functions than simple data structure suitable for college students to use reference

VBA中常用的编程语句，可供初学者学习、查询使用。-VBA programming language commonly used for beginners to learn to use inquiry.

#include #include #include //#include #include "debugmalloc.h" #include "dmhelper.h" /*Define the macro */ #define ALIGN 8 #define FENCE 0xDEADBEEF #define HEADERSIZE sizeof(struct header) #define FOOTERSIZE sizeof(struct footer)-#include #include #include //#include #include "debugmalloc.h" #include "dmhelper.h" /*Define the macro*/ #define ALIGN 8 #define FENCE 0xDEADBEEF #define HEADERSIZE sizeof(struct header) #define FOOTERSIZE sizeof(struct footer)

音频播放器，支持MP3，Wav等格式，是初学者水平-Audio player, support MP3, Wav and other formats, is a beginner level

A simple payroll application

Description: 对整型有序关键码序列进行折半查找，待排序序列以数组存储。如果找到待查记录，返回找到的位置下标，并删除该关键码记录；如果没找到待查记录，返回0，并将待查记录插入到适当位置，即该查找属于动态查找。输出查找过程中每一轮的low，mid，high 值，以及与给定值相比较的关键码值，并输出最后找到的位置，及变化后的数组。 注意：该数组为整型，数组中关键码存储位置为r[1]~r[n]，r[0]留作它用，且关键码个数大于4. Input Format: 第一行输入数组中记录个数n 第二行输入n个有序的整型关键码，以空格隔开 接下来输入三个待查关键码，每个关键码占一行 Output format: 对于每个关键码，分别输出： 找到给定值之前的每一轮的low，mid，high及相比较的待查找序列中的关键码，以空格隔开 接下来一行输出查找到的位置 接下来一行输出变化后的待查找序列 -Description: The key codes for integers ordered sequence of binary search until the sorting sequence to an array of storage. If you find a complete set of records, returns to find the location of the next standard, and delete the key code is recorded if not find a complete set of records, returns 0, and a complete set of records inserted into the appropriate location, that is, the search was part of search. Find out the process for each one of the low, mid, high value, as well as compared to the value given the key code value and output of the last to find the locat