登录
首页 » Visual C++ » CEIA

CEIA

于 2011-10-25 发布 文件大小:3KB
0 245
下载积分: 1 下载次数: 2

代码说明:

  POJ141的源代码,以空间换时间,速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)

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

发表评论

0 个回复

  • linearlist
    说明:  线性链表的定义,遍历,查找,删除,排序。(Linear list definition, traversal, search, delete, sort.)
    2011-04-07 14:08:14下载
    积分:1
  • duilie
    队列的一般数据结构 队列的创建 删除 修改 取数据等等(The general data structure queue queue to take the data and so create delete modify)
    2010-09-08 14:36:38下载
    积分:1
  • Cpp1
    校园导游,可以选择景点序号来了解景点,通过选择两点可计算最短距离和最近路线。(Campus tour guide, you can choose the attractions serial number to understand the attractions of by selecting the shortest distance can be calculated and the recently routes.)
    2012-06-20 21:57:32下载
    积分: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
  • KDTreeTest
    一个KDtree的程序,包含建树过程和消耗的时间。(A KDtree procedures, including the contribution to the process and time consuming.)
    2020-12-22 10:29:08下载
    积分: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
  • chazhao
    数据结构课程作业,查找算法。用哈希算法下实行查找(Data structure course work, search algorithm. Under the hash algorithm used to find)
    2009-07-08 02:41:51下载
    积分:1
  • permutations
    组合数学全排列,包含有六种全排列的方法,字典序法(math of permutations)
    2011-12-12 10:51:16下载
    积分:1
  • pinfanfangwen
    设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
    2015-01-15 22:31:59下载
    积分:1
  • single
    单链表逆置的源码~提供了源码和源码说明~简单实用,适用于课堂作业程度(Reverse single linked list provides a set of source code source code and source code ~ ~ simple and practical instructions for classroom work degree)
    2011-02-15 13:58:07下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载