登录
首页 » Visual C++ » mifeng

mifeng

于 2014-04-28 发布 文件大小:270KB
0 457
下载积分: 1 下载次数: 3

代码说明:

  c语言平时作业练习,包括输入输出,数组,链表等 c语言平时作业练习,包括输入输出,数组,链表等(output mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifeng)

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

发表评论

0 个回复

  • 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
  • DoubleStack
    数据结构基础内容,两栈共享空间,参考《大话数据结构》(Structural basis of data content, two stacks shared space, refer to Westward data structure )
    2014-12-06 12:09:30下载
    积分:1
  • Large_integer_multiplication
    算法分析与设计——大整数乘法。 计算两个超出机器数表示范围的整数的乘积。(Algorithm Analysis and Design- large integer multiplication. Calculating the number of two machines that go beyond the scope of the product of an integer.)
    2009-05-08 14:21:06下载
    积分:1
  • C-data
    大一c语言实验的所有源码以及实验报告报告(All source code and report experimental freshman c language)
    2016-12-23 23:43:39下载
    积分:1
  • labyrinth
    迷宫问题c源代码,大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标,输出所有可能的路径(Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths)
    2010-12-19 23:31:36下载
    积分:1
  • point
    用分治算法(O(nlogn)复杂度)实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))
    2012-12-16 13:14:04下载
    积分:1
  • LINK
    建立链表的算法: 新节点链入表尾建立链表: 动态分配第一个节点变量; 用指针head 妥善保存链表第一个节点的地址值; 依次动态分配一个新节点变量; 将上一个节点的指针域指向新生成的节点; 循环3),4)步骤,直到所有节点均连入链表; 将最后一个节点的指针域赋值为0; (Establish the list of algorithms: The new node links footer build list: Dynamic allocation of the first node variable Keep the list head pointer of the first node address value In order to dynamically allocate a new node variable The domain of a node pointer to the new generation of nodes Cycle 3), 4) step, until all nodes are connected to the chain Pointer field will last node assigned to 0 )
    2015-01-05 16:03:48下载
    积分:1
  • qiongju
    八皇后算法,用的是最简单的穷举法,在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)
    2013-08-14 22:21:28下载
    积分:1
  • text
    输入N个点的坐标,判断这N个点能否构成一个凸多边形。(Enter the coordinates of N points, to determine whether the N points form a convex polygon.)
    2011-12-13 09:43:42下载
    积分:1
  • StackandQueue
    该ppt包含了栈和队列的数据结构及基本操作,同时还有栈的举例(This ppt contains the stack and queue data structure and basic operation, as well as examples of the stack)
    2013-12-06 21:02:24下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载