登录
首页 » Visual C++ » classical-algorithm-VCPP

classical-algorithm-VCPP

于 2013-01-15 发布 文件大小:15KB
0 195
下载积分: 1 下载次数: 2

代码说明:

  常用的算法经典代码,包括快速排序,冒泡排序等各种排序方法,还有二叉树的前序、中序和后序遍历等(The classic algorithm code, including quick sort and bubble sort sorting methods, as well as the preamble of the binary tree, inorder and postorder traversal, etc.)

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

发表评论

0 个回复

  • ExchangeTree
    先序创建二叉树,将二叉树所有节点的左右子树交换,再先序遍历输出(create a binary tree in first order, exchange all the nodes of the binary subtree , then preorder output)
    2014-07-08 21:30:13下载
    积分: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
  • prim
    普利姆算法用来求解最小生成树问题很容易,使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)
    2012-05-17 09:11:15下载
    积分:1
  • list-and-array
    数组的定义与使用,数组的运算,字符串的输入与输出,冒泡排序(list and array)
    2013-10-17 11:32:30下载
    积分: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
  • BFS
    迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)
    2013-12-26 22:08:58下载
    积分: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
  • c++
    一款可以排序的小程序,希望大家可以看一下(A sort of small program, I hope you can look at it)
    2017-12-13 20:06:55下载
    积分:1
  • courseDesign
    C语言课程设计例子,迷宫的实现,包括了需求分析,概要设计,详细设计,测试,源代码等(C language curriculum design example, the realization of the maze, including requirements analysis, preliminary design, detailed design, testing, source code, etc.)
    2011-11-23 23:41:04下载
    积分:1
  • Task1-trial--10211281--zly
    描述:足球俱乐部包括球员、普通行政人员。球员有姓名、年龄、能力、年薪、转会费、进球总数、服役年限等重要参数;普通行政人员有姓名、年龄、能力、年薪等参数。你需要给相关管理机构开发一个管理程序,实现对众多足球俱乐部管理的基本功能。具体功能包括: a) 俱乐部的增删改查,俱乐部的属性包括名称、现金、其下人员; b) 可以对所有球员的各项属性进行简单搜索,支持输入多个条件,条件之间用&&连接,例如: i. “年龄不大于25且服役年限大于5年且进球数大于100的球员”,查询表达式:!(@age>25) && @experience>5 && @kick>100 c) 支持球员在不同俱乐部间的买卖,买卖需符合以下条件:作为买方的俱乐部的现金>=球员的转会费,交易完成后,卖方将得到转会费。 要求: d) 必须采用面向对象的方式,使用类组织数据结构,并注意类的继承关系; e) 在题目要求基础上可以自行扩展功能,提供扩实用扩展功能者适当加分(加分不超过5分)。 (Description: Football club including players, general administrative staff. Player name, age, ability, salary, transfer fee, total number of goals, service life and other important parameters ordinary administrative staff name, age, ability, salary and other parameters. You need to give the relevant management agencies to develop a management program to achieve the number of football club management s basic functions. Specific features include: a) the club CRUD, the name of the club s property, including cash, under which personnel b) all players can perform a simple search of the property, supports input multiple conditions with && connection between conditions, for example: i. "Age is not greater than 25 and greater than 5 years service life and goals more than 100 players," query expression:! (@ age> 25) && @ experience> 5 && @ kick> 100 c) Support the players traded between different clubs, the sale subject to the following conditions: As a buyer s club cash> = pl)
    2013-08-20 10:09:29下载
    积分:1
  • 696518资源总数
  • 106155会员总数
  • 8今日下载