登录
首页 » Visual C++ » SqStack

SqStack

于 2012-03-15 发布 文件大小:191KB
0 119
下载积分: 1 下载次数: 2

代码说明:

  大学计算机专业教材《数据结构》中栈的实验、练习源码(University computer professional teaching materials" data structure" stack experiment, practice source code)

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

发表评论


0 个回复

  • 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
  • nuaa1507_DancingLink_trackback.cpp
    高德纳发明的高效数据结构dancing link,这里是解重复覆盖问题的一个演示(Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration)
    2010-03-07 10:54:32下载
    积分:1
  • FinalExam
    C语言期末考试题,含答案。数组、链表、函数等的使用和C编程。(failed to translate)
    2011-11-07 20:07:25下载
    积分:1
  • m-in
    说明:  数据隐私保护K-匿名问题的动态多次发布类似m-invarience算法(Data Privacy Protection K-anonymity problem on many occasions issued a similar dynamic m-invarience algorithm)
    2008-09-25 08:06:33下载
    积分:1
  • link
    实现链表的一些操作,方便进行遍历,查找等程序(Operation, convenient linked list traversal, the search procedure)
    2013-05-01 11:49:22下载
    积分:1
  • Birch
    这是birch C语言的源代码。里面有详细的代码注释方便学习birch算法(birch c)
    2012-05-08 09:00:44下载
    积分:1
  • Czhihen
    关于C语言的一些指针的处理算法,能够使得初学者对C语言指针有自己的了解(Some pointers on C language processing algorithms, it is possible to make a beginner C language pointer has its own understanding)
    2016-06-17 11:29:59下载
    积分:1
  • maopao_youhua
    冒泡优化: 如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行,优化之后1次就好,也就是说序列越接近于正常序列,改进之后的冒泡排序的次数就越少,这样会给一个冒泡排序算法带了很大的效率。 思想:添加一个boolean变量用来判断冒泡是否是已经排好了顺序,如果boolean的值为false,说明是已经排好了,如果boolean的值true,说明没有排好,继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency. Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
    2012-04-18 00:33:45下载
    积分:1
  • main5
    编写一个将二叉树的所有叶子结点从左向右链接成单链表的算法(Write a binary tree leaf nodes from left to right links into a single linked list algorithm)
    2012-10-07 23:52:44下载
    积分:1
  • Hanoi
    简单的汉诺塔算法,采用归约算法的思想,实例是三个盘子,三个柱子(Simple HANOR algorithm)
    2012-07-16 20:48:59下载
    积分:1
  • 696518资源总数
  • 104812会员总数
  • 16今日下载