登录
首页 » Visual C++ » data_structure

data_structure

于 2012-07-19 发布 文件大小:138KB
0 259
下载积分: 1 下载次数: 3

代码说明:

  数据结构c源代码实现,大概有100个左右,基本上将所有的数据结构都有介绍(Data structures c source code to achieve, there are about 100 or so, basically all of the data structures are described)

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

发表评论

0 个回复

  • shujujiegoukechengshiji
    数据结构课程设计时,所需的封面及任务书版面,希望对大家有点用!(Curriculum design data structure, the necessary task of the book cover and layout, in the hope that we are a bit used!)
    2008-06-16 18:38:51下载
    积分:1
  • bTree
    这是一个二叉树的工程文件,包括了工程文件里的所有文件。以及二叉树的构建,traverse,搜索等功能函数。(This file contains a summary of what you will find in each of the files that make up your bTree application. )
    2011-05-20 08:12:04下载
    积分:1
  • code
    各种数据结构代码,欢迎下载,里面有JAVA,C,C++等等各种版本(Data structure and code, please download)
    2010-06-22 11:11:45下载
    积分:1
  • Huffman
    程序可以实现哈弗曼自动编码功能!很详细的!很有参考价值!(Program can be Havermann automatic coding features! Very detailed! A good reference!)
    2010-07-21 22:06:48下载
    积分:1
  • ch555555
    C数据结构常用算法程序集5,描述数据结构算法。(C data structures commonly used algorithm suite 5, describe data structure algorithms.)
    2005-05-09 16:17:59下载
    积分:1
  • zhebanchazhao
    这半查找法 是一种快速查找算法 查找效率比较高 容易实现 理想的查找算法(This search method is a fast and find more efficient algorithms to find easy to implement the ideal search algorithm)
    2012-05-04 00:03:29下载
    积分:1
  • Strassen-code
    思塞恩算法 常用算法之一 算法导论提及(strassen algorithm which can run correctly)
    2014-11-28 14:33:16下载
    积分:1
  • point_to_line
    计算点到直线的距离.输入两点坐标确定一个直线,再输入一个点的坐标,计算该点到直线的距离.(Calculated point to the straight line distance. Enter the coordinates of two points determine a straight line, and then input the coordinates of a point, to calculate the straight-line distance between points.)
    2020-11-30 15:09:27下载
    积分:1
  • fast_sort
    /*快速排序:以待排序元素中的第一个元素作为基准将带排序的元素分为三组 *大于基准元素为一组置于基准值的右边,小于基准值的元素为一组置于基准值的左边, *基准值为一组,这样就找到了基准元素的位置就确定了 *如此递归调用。直到每一组的low==high,即实现了排序的要求。 */ (/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
    2012-10-26 21:42:43下载
    积分:1
  • 3.4.6
    单链表中的数据元素含有三种字符(字母、数字、其他字符),算法实现构造三个循环链表,是每个循环链表中只含有同一类字符,且利用原表中的结点空间作为这三个表的结点空间。(Singly linked lists of data element contains three characters (letters, Numbers and other characters), the algorithm constructs three circular linked list, each cycle list contains only the same type of character, and make use of the primary node space in a table as a node of the three table space.)
    2014-04-15 13:11:37下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载