资源列表
shujujiegou3
- 掌握多种内排序方法的基本思想、排序过程、算法实现，能进行时间和空间性能的分析，根据实际问题的特点和要求选择合适的排序方法。-Grasp the basic idea of a variety of internal sorting algorithm, sorting process, the algorithm can be time and space performance analysis, according to the characteristics and requirement
WiFi--V1.3
- 一种用于家用电器设备与互联网云端通讯的协议。已验证可靠。-wifi xieyi
tongxnlu5
- 简易的通讯录，可实现查找联系人、新建联系人、修改联系人信息和删除联系人信息。-Simple address book, can be found to find contacts, new contacts, modify contact information and delete contact information.
1612261
- c++实现在一个序列中找出最长不减子序列-C++ implementation in a sequence to find the longest subsequence does not decrease
queue
- some code to create queue data struct in C
B-Tree_danciking
- 使用B树编写实现背单词功能。可添加删除单词，可修改单词熟悉度，可查询排序为第k个的单词-Use B-tree prepared to achieve word back function. Delete the word to add, modify the word familiarity, can be found at the k-th order of words
RB_Tree_danciking
- 使用红黑树编写“背单词”应用，根据熟悉度进行排序，熟悉度相同根据字典序排序。可添加，删除单词，也可以修改单词的熟悉度。可查找第k个单词，或计算kth到lth的单词熟悉度综合。-Use red-black tree to write " back the word" application, based on familiarity sort of familiarity same lexicographically sorted. You can add, delete wor
zhan-deyingyong
- 一、实验目的 1.掌握栈的存储、基本运算； 2.掌握利用栈实现十进制数转换成八进制数的运算。 二、实验内容 1.栈的存储、基本运算； 2.利用栈实现十进制数转换成八进制数的运算。-A, experimental purposes 1. Master the stack storage, basic operation 2. Master the stack to achieve a decimal number converted to octal number o
data-structure
- 数据结构 c代码实现 严蔚敏版本版本版本 要怎么写才能通过啊-data structure
spatialindex-JAVA
- JAVA实现的R树，提供高效的低维空间搜索性能-Java implemented R-tree，whose performance on low dimension spatial search is quite high
libspatialindex-master
- C++实现的R树，MVR树以及TPR树，提供C语言接口-C++ implementation of R*-tree, an MVR-tree and a TPR-tree with C API
日平均水位计算
- 采用48加权法，利用VB编写。源码内含有用文本框向MSFlexGrid控件输入数据。