登录
首页 » Visual C++ » Data-structure

Data-structure

于 2011-03-08 发布 文件大小:57KB
0 185
下载积分: 1 下载次数: 0

代码说明:

说明:  分别用堆栈和数组的方法实现任何进制的数制转换(Arrays were used to stack and method of implementation of any binary number system conversion )

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • hanoi
    Hanoi塔问题非递归算法实现,几个具体的实现算法(Tower of Hanoi non-recursive algorithm, the realization of a number of specific algorithms)
    2009-07-13 08:45:51下载
    积分:1
  • huffman_tree
    数据结构学习中提供的不错的源码,一个哈夫曼树类,利用了链队列存储结构。压缩包中有七个文件。(Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.)
    2013-12-28 15:21:48下载
    积分:1
  • CAR
    some problems about c++.(car.cpp)
    2012-01-12 14:39:48下载
    积分:1
  • strap_down_inertial_navigation
    说明:  捷联系统C语言实现算法,已经过实验验证。(SINS C language algorithm, has been verified by tests.)
    2008-11-20 16:50:37下载
    积分:1
  • KMP
    说明:  KMP算法的具体实现,能够在O(n+m)时间内找出字串在父串中的位置,n为父串长度,m为字串长度(KMP in the proposed algorithm, can be O (n+ m) time to find the string in the parent string position, n the parent string length, m for the string length)
    2010-04-28 16:18:00下载
    积分:1
  • paixu
    2008软件公司面试题:排序大全:简单选择排序、冒泡排序、选择排序、shell排序、快速排序、插入排序、堆排序(从小到大)、归并排序(利用递归)(2008 software companies face questions: Sort Guinness: simple choice to sort, bubble sort, select sort, shell sort, quick sort, insert sort HEAPSORT (from small to large), Merging Sort (recursive))
    2008-12-10 16:53:40下载
    积分:1
  • edge-betweenness
    计算边介数,复杂网络,中心性计算,介数也可以计算,运用了数据结构,计算大量数据(edge betweenness,complex network, centrality)
    2021-05-15 01:30:03下载
    积分:1
  • Hash-table
    哈希表 数据结构课程设计 1.1问题描述 针对自己的班集体中的“人名”设计一个哈希表,使得平均查找长度不超过R,完成相应的建表和查表程序。 1.2基本要求 假设人名为中国姓名的汉语拼音形式。待填入哈希表的人名共有30个,取平均查找长度的上限为2。构造哈希函数,用链表法处理冲突。 1.3测试数据 读取熟悉的30个人的姓名作测试。(Hash table Data Structure Course Design 1.1 Description of the problem For their own class group of the "names" to design a hash table, making the average search length does not exceed R, the completion of construction of tables and look-up table corresponding procedures. 1.2 Basic requirements Assuming the name of the person called Chinese pinyin form. To be filled into a hash table names a total of 30, taking the average search length of the upper limit of 2. Construct a hash function, treatment with a list of conflict. 1.3 Test Data Read the familiar names of 30 individuals tested.)
    2011-12-19 15:39:00下载
    积分:1
  • ANT
    A*算法通过启发式探索下一结点,逐步逼近目标结点,且使得路径最短。(A* algorithm heuristic to explore the next node, and gradually approaching the target node, and that the shortest path.)
    2012-05-17 09:14:21下载
    积分:1
  • KMP---MFC
    数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)
    2020-07-04 08:40:01下载
    积分:1
  • 696516资源总数
  • 106436会员总数
  • 7今日下载