| 数据结构与图形技术 |
| |
| 引用本文： | 高全清,张衍杰. 数据结构与图形技术[J]. 山东理工大学学报：自然科学版, 1997, 0(4) |
| |
| 作者姓名： | 高全清 张衍杰 |
| |
| 作者单位： | 山东工程学院计算机工程系 |
| |
| 摘 要： | 为了更好地理解和掌握链式存储结构、笔者尝试用图形和地址来表示数据结构中的物理存储结构及运算结果,收到了较好的效果.本文分析用图形和地址表示动态变量的分配问题.
|
| 关 键 词： | 图形 指针 线性表 排序 查找 动态分配 |
Data Structure and Graphic Technology |
| |
| Gao Quaning Zhang Yanje. Data Structure and Graphic Technology[J]. Journal of Shandong University of Technology:Science and Technology, 1997, 0(4) |
| |
| Authors: | Gao Quaning Zhang Yanje |
| |
| Affiliation: | Department of Computer Engineering |
| |
| Abstract: | Data structure and algorithm are two important parts of the computer science. The concept of dynamic contribution in data structure seems to be abstrct and the chain contribution algorithm is so difficutly realized that corresponding programme would get errors easily. In order to know well the chain memory structure, The authors have tried to express some physical memory structures and computation results by using graphics and addresses and got better effects. This paper analyses the constribution of dynamic variables expressed by graphy and address. |
| |
| Keywords: | Graphy Pointer Linear table Odering Dynamic contribution |
| 本文献已被 CNKI 等数据库收录！ |
