-
CR17_2014.05.19_list
数据结构线性表教学笔记,内容讲基础知识,没基础可以看看(Linear table data structure teaching notes, basic knowledge content says, no base can take a look)
- 2014-06-09 23:35:37下载
- 积分:1
-
KMP---MFC
数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)
- 2020-07-04 08:40:01下载
- 积分:1
-
二叉树
这是一个二叉树程序,包含删除等功能,希望帮助到大家(This is a binary tree program, including deletion and other functions, I hope to help you.)
- 2020-06-24 08:40:01下载
- 积分:1
-
tree
使用非递归的方法遍历二叉树,可以直接运行。(
Non-recursive binary tree traversal.)
- 2013-12-04 16:08:43下载
- 积分:1
-
four
四叉树递归
此种模型绘制类似米字形的网格。由于整个过程递归调用绘图函数,所以可以根据误差判断绘制DEM的精细程度,从而绘制出不同精细程度的DEM,为解决漫游中数据量较大而引起的画面不流畅现象提供了模型基础。 本文并没有对LOD作研究,只是给出了四叉树的建立和遍历绘图的方法。
(Recursive quadtree rendering such models similar character-meter grid. Recursive calls as a result of the whole process of mapping function, so it can be judged according to the error map of the fine DEM, thus rendering a different degree of precision DEM, for the settlement of roaming in the amount of data arising from the larger screen does not provide a model of fluid based on the phenomenon. This article does not LOD for research, but given quadtree traversal of the establishment and mapping method.)
- 2008-02-12 16:42:20下载
- 积分:1
-
maintaqehce-capacity
带MMX优化算法的图形硬件放大缩小显示的模块化代码,可以商用的哦!()
- 2018-05-27 20:13:57下载
- 积分:1
-
BTree
排序二叉树(模板类),主要用于数据排序和查找。已在项目中使用(Sorted binary tree (template class), mainly used for data sorting and searching. Has been used in the project)
- 2010-10-09 13:49:44下载
- 积分:1
-
Tetris
使用很好的数据结构,程序运行效率高,界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)
- 2013-03-27 10:51:16下载
- 积分:1
-
c++链表模板类,实现所有链表的功能!
c++链表模板类,实现所有链表的功能!包括增删改查,反转、递归反转等功能。对数据结构初学者有极高的参考价值。且代码规范,命名规范,有很多注释帮助理解。
- 2022-08-16 10:11:43下载
- 积分:1
-
stock
在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆,并将新的一堆石子数记为该次合并的得分。试设计一个算法,计算出将n堆石子合并成一堆的最小得分和最大得分。
(Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pile. Provisions can only choose 2 adjacent stones piled into a heap of new and new pile of stones a few in mind for its combined score. Try to design an algorithm to calculate the n heap into a pile of stones the minimum scores and maximum scores.)
- 2007-12-25 00:34:14下载
- 积分:1