登录
首页 » Visual Basic » code

code

于 2010-06-22 发布 文件大小:171KB
0 133
下载积分: 1 下载次数: 2

代码说明:

  各种数据结构代码,欢迎下载,里面有JAVA,C,C++等等各种版本(Data structure and code, please download)

文件列表:

code
....\C
....\.\data_structure
....\.\..............\aatree.c,6181,2007-11-28
....\.\..............\aatree.h,669,2007-11-28
....\.\..............\avltree.c,5593,2007-11-28
....\.\..............\avltree.h,583,2007-11-28
....\.\..............\binheap.c,3364,2007-11-28
....\.\..............\binheap.h,588,2007-11-28
....\.\..............\binomial.c,6727,2007-11-28
....\.\..............\binomial.h,762,2007-11-28
....\.\..............\cursor.c,4474,2007-11-28
....\.\..............\cursor.h,890,2007-11-28
....\.\..............\disjsets.c,2564,2007-11-28
....\.\..............\dsl.c,4737,2007-11-28
....\.\..............\dsl.h,701,2007-11-28
....\.\..............\fatal.h,156,2007-11-28
....\.\..............\fig10_38.c,848,2007-11-28
....\.\..............\fig10_40.c,808,2007-11-28
....\.\..............\fig10_43.c,464,2007-11-28
....\.\..............\fig10_45.c,746,2007-11-28
....\.\..............\fig10_46.c,2224,2007-11-28
....\.\..............\fig10_53.c,2017,2007-11-28
....\.\..............\fig10_55.c,773,2007-11-28
....\.\..............\fig10_62.c,1529,2007-11-28
....\.\..............\fig1_2.c,284,2007-11-28
....\.\..............\fig1_3.c,305,2007-11-28
....\.\..............\fig1_4.c,374,2007-11-28
....\.\..............\fig2_10.c,468,2007-11-28
....\.\..............\fig2_11.c,486,2007-11-28
....\.\..............\fig2_9.c,945,2007-11-28
....\.\..............\hashfunc.c,879,2007-11-28
....\.\..............\hashquad.c,3952,2007-11-28
....\.\..............\hashquad.h,704,2007-11-28
....\.\..............\hashsep.c,3935,2007-11-28
....\.\..............\hashsep.h,715,2007-11-28
....\.\..............\kdtree.c,2724,2007-11-28
....\.\..............\leftheap.c,3028,2007-11-28
....\.\..............\leftheap.h,876,2007-11-28
....\.\..............\list.c,3974,2007-11-28
....\.\..............\list.h,783,2007-11-28
....\.\..............\max_sum.c,3578,2007-11-28
....\.\..............\pairheap.c,6391,2007-11-28
....\.\..............\pairheap.h,688,2007-11-28
....\.\..............\poly.c,2651,2007-11-28
....\.\..............\queue.c,2820,2007-11-28
....\.\..............\queue.h,572,2007-11-28
....\.\..............\redblack.c,6639,2007-11-28
....\.\..............\redblack.h,803,2007-11-28
....\.\..............\sort.c,9822,2007-11-28
....\.\..............\splay.c,6260,2007-11-28
....\.\..............\splay.h,747,2007-11-28
....\.\..............\stackar.c,2528,2007-11-28
....\.\..............\stackar.h,558,2007-11-28
....\.\..............\stackli.c,2057,2007-11-28
....\.\..............\stackli.h,497,2007-11-28
....\.\..............\testaa.c,893,2007-11-28
....\.\..............\testavl.c,799,2007-11-28
....\.\..............\testbin.c,631,2007-11-28
....\.\..............\testcurs.c,889,2007-11-28
....\.\..............\testdsl.c,548,2007-11-28
....\.\..............\testhash.c,938,2007-11-28
....\.\..............\testheap.c,400,2007-11-28
....\.\..............\testleft.c,435,2007-11-28
....\.\..............\testlist.c,857,2007-11-28
....\.\..............\testpair.c,857,2007-11-28
....\.\..............\testque.c,452,2007-11-28
....\.\..............\testrb.c,559,2007-11-28
....\.\..............\testsply.c,1022,2007-11-28
....\.\..............\teststka.c,289,2007-11-28
....\.\..............\teststkl.c,286,2007-11-28
....\.\..............\testtree.c,798,2007-11-28
....\.\..............\testtrp.c,895,2007-11-28
....\.\..............\treap.c,5331,2007-11-28
....\.\..............\treap.h,700,2007-11-28
....\.\..............\tree.c,3515,2007-11-28
....\.\..............\tree.h,608,2007-11-28
....\c%2B%2B
....\...\Code
....\...\....\AATree.cpp,9733,1998-06-07
....\...\....\AATree.h,2931,2002-12-28
....\...\....\AvlTree.cpp,10757,2002-03-01
....\...\....\AvlTree.h,3247,2002-12-28
....\...\....\BinaryHeap.cpp,3963,1998-06-07
....\...\....\BinaryHeap.h,1548,2002-12-28
....\...\....\BinarySearchTree.cpp,9213,2005-01-11
....\...\....\BinarySearchTree.h,3002,2002-12-28
....\...\....\BinomialQueue.cpp,9433,1998-06-07
....\...\....\BinomialQueue.h,2734,2002-12-28
....\...\....\bool.h,98,2002-12-28
....\...\....\BuggyIntCell.cpp,869,1998-11-12
....\...\....\Concordance1.cpp,1480,1998-06-07
....\...\....\Concordance2.cpp,2201,1998-06-07
....\...\....\CursorList.cpp,5375,1998-06-07
....\...\....\CursorList.h,3591,2002-12-28
....\...\....\DisjSets.cpp,1666,1998-06-07
....\...\....\DisjSets.h,976,2002-12-28
....\...\....\dsexceptions.h,201,2002-12-28
....\...\....\DSL.cpp,6451,2002-03-01
....\...\....\DSL.h,2498,2002-12-28

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

发表评论

0 个回复

  • NoGo
    计算机博弈大赛不围棋的代码 个人所写,可以用来参考( U8BA1 u7B97 u673A u535A u5F08 u5927 u8D5B u4E0D u56F4 u68CB u7684 u4EE3 u7801 u4E2A u4EBA u6240 u5199 uFF0C u53EF u4EE5 u7528 u6765 u53C2 u8003)
    2021-04-04 19:39:04下载
    积分:1
  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • codes
    数据结构相关代码,源码-数据结构算法解析(高一凡 )(Data structure-related code, source code- Data Structure Analysis algorithm (high one where))
    2008-05-23 02:41:54下载
    积分:1
  • PROGRAM
    本书是《程序员面试宝典》的第三版,在保留第二版的数据结构、面向对象、程序设计等主干的基础上,使用各大IT公司及相关企业最新面试题替换和补充原内容,以反映自第一版以来近几年时间所发生的变化。   欧立奇、刘洋、段韬编著的《程序员面试宝典》取材于各大公司面试真题(笔试、口试、电话面试、英语面试,以及逻辑测试和智商测试),详细分析了应聘程序员(含网络、测试等)职位的常见考点。本书不仅对传统的C系语言考点做了详尽解说,还根据外企出题最新特点,新增加了对友元、Static、图形/音频、树、栈、ERP等问题的深入讲解。最后本书着力讲述了如何进行英语面试和电话面试,并对求职中签约、毁约的注意事项及群体面试进行了解析。本书的面试题除了有详细解析和答案外,对相关知识点还有扩展说明。真正做到了由点成线,举一反三,对读者从求职就业到提升计算机专业知识都有显著帮助。   《程序员面试宝典》适合计算机相关专业应届毕业生阅读,也适合作为正在应聘软件行业的相关就业人员和计算机爱好者的参考书。(This book is the" canon" in the third edition, retained in the second version of the data structure, object-oriented program design, main basis, the use of each big IT companies and related enterprises to the latest interview questions substitution and supplement the original content, in order to reflect the since its first edition in recent years since time changes. Ou Liqi, Liu Yang, Duan Tao," canon" drawn from major companies interview questions ( written examination, interview, telephone interview, interview, and logical test and IQ test ), a detailed analysis of the application programmer (including network, testing ) positions of the common points. This book not only to the traditional C language test done a detailed explanation, according to the new characteristics of the new foreign title, added to the friend, Static, graphics/audio, tree, stack, ERP issues in depth explanation. The last book on described how the English interview and telephone interview, and the job of signin)
    2012-03-21 11:28:19下载
    积分:1
  • list-and-array
    数组的定义与使用,数组的运算,字符串的输入与输出,冒泡排序(list and array)
    2013-10-17 11:32:30下载
    积分:1
  • Ex1
    从屏幕输入字符 判断括号匹配问题 数据结构作业(Judgment parenthesis matching data structure operations input characters from the screen)
    2012-11-27 15:17:10下载
    积分: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
  • work1
    讲解了循环单链表的建立,以及在链表中插入、删除、更改数据...(Explain the establishment of circular single linked list, and insert in the list, delete, change the data ...)
    2010-10-03 11:00:45下载
    积分:1
  • ds3
    单向链表的创建与操作 设单向链表中节点的数据域的数据类型为整型,编写函数实现以下操作: (1)实现单向链表的创建(包括初始化)与输出操作,节点的个数及节点的数据由用户输入。 (源代码:ds3-1.c) (2)查找给定的单链表中的第i个节点,并将其地址返回。若不存在第i个节点,则返回空地址。 (源代码:ds3-2.c) (3)查找给定的单链表中值为n的节点,并将其地址返回。若不存在值为n的节点,则返回空地址。同时,还应通过参数传回该节点的序号。 (源代码:ds3-3.c) (4)删除给定的单链表中的第i个节点,成功返回1,失败返回0。 (源代码:ds3-4.c) (5)删除给定的单链表中值为n的节点,成功返回1,失败返回0。 (源代码:ds3-5.c) (6)在给定的单链表的第i位上插入值为n的节点。 (源代码:ds3-6.c) (7)在给定单链表的值为m的节点的前面插入一个值为n的节点。 (源代码:ds3-7.c) (Creation and operation of a one-way linked list Set up a one-way linked list data type node integer data fields , write a function to achieve the following: ( 1 ) achieve the creation of a one-way linked list ( including initialization ) and output operation , the number of nodes and node data entered by the user . ( Source : ds3-1.c) ( 2 ) Find a single list given in the i-th node and returns its address . Without the presence of the i-th node , returns an empty address. ( Source : ds3-2.c) ( 3 ) Find a given node in a given value of n single list , and return address . Without the presence of the value of n nodes , returns an empty address. Meanwhile, the number should be returned by the parameters of the node . ( Source : ds3-3.c) ( 4 ) Delete the given singly linked list in the i-th node , the successful return 1, else return 0 . ( Source : ds3-4.c) ( 5 ) to delete a single node in the list is given n , the successful return 1, else return 0 . ( Source : ds3-5.c) ( 6 ) )
    2014-05-11 19:19:41下载
    积分:1
  • JOSEPHUS
    一个关于约瑟夫环问题的经典算法编程的C语言实现(the program about JOSEPHUS)
    2011-08-13 10:09:20下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 31今日下载