资源列表
Heap-sort
- 堆排序 堆排序利用了大根堆（或小根堆）堆顶记录的关键字最大（或最小）这一特征，使得在当前无序区中选取最大（或最小）关键字的记录变得简单。 （1）用大根堆排序的基本思想 ① 先将初始文件R[1..n]建成一个大根堆，此堆为初始的无序区 ② 再将关键字最大的记录R[1]（即堆顶）和无序区的最后一个记录R[n]交换，由此得到新的无序区R[1..n-1]和有序区R[n]，且满足R[1..n-1].keys≤R[n].key ③由于交换后新的根R[1]可能违反堆性质，故应将当前无序区
readbmp_24
- 用c语言编写读取bmp图像程序 自编程序 简单可行-Read bmp image program self programming c language is simple and feasible
ack
- Calculate the Ackermann function ACK ( m, n ) recursive functions.-Calculate the Ackermann function ACK ( m, n ) recursive functions. For m>=0, n>=0, ACK ( m, n ) is defined as: ACK ( 0, n ) =n+1 ACK ( m, 0) =ACK ( m-1,1 ) ACK ( m, n ) =ACK (
duiorder
- 堆排序的c++实现代码,堆排序的c++实现代码-The heap sort c++ achieve code, heap sort c++ implementation code
algorithm1111
- 冒泡排序 桶排序 计数排序 堆排序 二分插入排序 c语言实现多种算法-Bubble sort bucket sort counting sort heap sort two insertion sort C language to achieve a variety of algorithm
dev
- 智能agent教学,多模式教学系统的测试与工作方便下载!-Intelligent agent teaching, testing and to facilitate the work of the multi-mode teaching system download!
car-parking-lot
- 这是一个自动计时的停车场，此外车库的大小也可在在DOS框中随便定义 使我们更加全面认识停车场的系统-This is an automatic timed parking, In addition, the size of the garage can also be defined to make us a more comprehensive understanding of the parking system in the DOS box, casually
Remember-Poker
- 让计算机来猜测用户“暗记”的某张扑克牌：计算机从一副扑克牌（54张）中任意抽出27张，摆放在不同的三行上（每行9张），用户“暗记”某张纸牌，而后告诉计算机所“暗记”的那张纸牌处于哪一行中；之后计算机再两次将纸牌重新摆放，并让用户再回答两次相同的提问（那张纸牌在重新摆放后又处在哪一行上）；此时计算机会将用户所“暗记”的那张纸牌给挑出来。-Allow a computer to guess the user "counterfeitproof" the cards: computer at rand
NO-LIMIT
- 这是一个不错的二叉树 里面含有层次遍历，先序遍历 中序遍历 后序遍历等算法，很值得我们参考学习交流 NO limit 老王-This is a good binary tree which contains a level traversal, preorder traversal preorder traversal preorder traversal algorithms, it is worthy of our reference learning exchanges NO limi
Marty
- 此程序是一个相当全面的二叉树 里面有递归非递归的各种算法 仅供参考交流，谢谢 Marty 李丹-This program is a complete binary tree recursive recursive algorithm for reference only exchange, thank Marty Dan
sorting_BsearchLJH
- 用MFC实现六种排序功能，可以自己输入数据选用冒泡，堆，快速，插入，选择和希尔进行排序-Using MFC the six sorting capabilities, and can enter data selection bubbling reactor, fast, insert, select and Hill sort
shortest-way
- 最短路径寻优算法,也是通过矩阵来存储信息，获得最短的路径-The shortest path optimization algorithm, is also the shortest path through the matrix to store information