登录
首页 » Visual C++ » string.tar

string.tar

于 2009-11-08 发布 文件大小:3940KB
0 253
下载积分: 1 下载次数: 13

代码说明:

  数据结构课程设计--实现并对比三种基本的字符串匹配算法(EasyMatch Rabin—Karp KMP)

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

发表评论

0 个回复

  • bstree_frame
    利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)
    2013-08-10 16:43:50下载
    积分:1
  • CarClass
    数据结构简单的课程设计交通换乘算法,里面有零次换乘与一次换乘(Simple structure, curriculum design data traffic transfer algorithm, which have zero time transfer and a transfer)
    2011-01-09 10:33:14下载
    积分:1
  • Data.Structures.For.Game.Programmers
    说明:  详细介绍了游戏设计的数据结构注意事项,对与游戏中角色和游戏模式作者给予了督导的见解,书中语言为全英文但通俗易懂!很是推荐 (Data.Structures.For.Game.Programmers Detailed data structure of the game design considerations, the role with the game and game modes of supervision given to insights, the book in English but the language is easy to understand! It is recommended)
    2010-04-14 11:21:09下载
    积分:1
  • maze
    迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
    2013-12-13 17:55:45下载
    积分:1
  • paixu
    使用的排序算法,非常不错的思维,比较其他有较大优势(Sorting algorithm used, very good ideas, have greater advantages compared with other)
    2009-05-05 17:54:54下载
    积分:1
  • erchashu
    二叉树的链式存储、先序中序遍历和层次遍历。(构造一棵树并输入数据,编写三个函数,非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法(这里的非递归以中序为例)。在主程序中调用这三个函数进行树的遍历,观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。)(Chain store binary tree, preorder traversal and hierarchy traversal.)
    2013-12-07 23:16:06下载
    积分:1
  • b
    说明:  定义一个类SortArray继承自MyArray,在该类中定义函数sort实现排序功能。 定义一个类ReArray继承自MyArray,在该类中定义函数reverse实现逆转功能。 定义一个类AverArray继承自MyArray,在该类中定义函数Aver实现求解整数的平均值。 定义NewArray类,同时继承了SortArray、ReArray和AverArray,使得NewArray类的对象同时具有排序、逆转和求平均值的功能。在继承的过程中声明为虚基类,体会虚基类在解决二义性问题中的作用。 (Define a class SortArray inherited from MyArray, defined in the class sorting function sort implementation. Define a class ReArray inherited from MyArray, define the function in reverse to achieve such reversal function. Define a class AverArray inherited from MyArray, defined in the class to solve integer function Aver achieve the average. Defined NewArray class, and inherits SortArray, ReArray and AverArray, making the object of both NewArray class sorting, reversing, and the mean value of the function. In the process of succession declared as virtual base classes, virtual base class experience in resolving ambiguities of the role.)
    2010-06-02 02:13:03下载
    积分:1
  • yinhangmoni
    这是一个简单的银行模拟系统 1、 客户的到达时间随机 2、 客户需要处理的业务随机(不同业务处理的平均长度不同,例如:取款时间较短,开户和销户时间较长) 3、 处理客户业务所需时间随机(在一定范围内) 4、 使用文本文件记录每个客户到达时间、业务处理时间、业务结束时间 5、 动态显示(刷新时间可调)目前每个窗口累计处理客户数量、等待人数,每个窗口的平均业务处理时间,不同业务类型业务的累计办理量。 (This is a simple bank simulation system 1 customer arrival time random 2, customers need to deal with the business of random (the average length of the different business processes, such as: the withdrawal shorter, longer to open an account and cancel the account) 3, the time required to deal with customer service random (within certain limits) 4, using a text file to record each customer arrival time, business processing time, the business end of time 5 dynamically display (refresh time is adjustable) each window is accumulated to handle the number of customers waiting for the number the average business processing time of each window, different type of business operations total for the amount.)
    2012-11-22 00:08:18下载
    积分:1
  • string.tar
    数据结构课程设计--实现并对比三种基本的字符串匹配算法(EasyMatch Rabin—Karp KMP)
    2009-11-08 12:20:02下载
    积分:1
  • maze
    迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
    2013-12-13 17:55:45下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载