登录
首页 » Visual C++ » ysph

ysph

于 2009-03-14 发布 文件大小:1KB
0 268
下载积分: 1 下载次数: 29

代码说明:

  约瑟夫环,数据结构算法,挺有意思,看看,看看(ysphdfgfgf)

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

发表评论

0 个回复

  • paixu
    实现冒泡,快速,希尔排序法。并计算,比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)
    2012-05-21 22:13:12下载
    积分:1
  • lianbiaoqiujiaoji
    该程序是数据结构中以链表存储形式来求两个集合的交集,用C++语言描述的(The program is the form of a linked list stored in the data structures to seek the intersection of two sets, C++ language to describe)
    2012-04-24 22:35:37下载
    积分:1
  • tt0202
    1.建立两个有序得链表(带表头,用头插法); //2.写一算法在单链表上实现线性表的ListLength(L)运算。 写一算法将单链表中值重复的结点删除,使所得的结果表中各结点值均不相同。 (1. The establishment of two ordered lists too (with header, with the first interpolation) // 2. To write a method to achieve a single linked linear form of ListLength (L) operations. Write an algorithm to list the value of a single node to delete the duplicate, so the results in the table are not the same as the value of each node.)
    2010-09-10 10:26:46下载
    积分:1
  • heapsort
    说明:  从最后一个非叶子结点开始从后往前进行调整,保证了根下的所有子树都是最大堆,最后对根进行调整,使整棵二叉树为最大堆,保证了根结点为整棵数的最大值点,完成了建堆的过程,再将根结点跟最后一个结点进行交换,如此反复操作,则堆排序就完成了,其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
    2008-11-11 22:53:42下载
    积分:1
  • library
    纯C语言编程的模拟现有图书馆的借阅、续借、归还;图书入库、出库;查询、排序等功能,实现电子图书馆的智慧综合管理。其中查询功能里面嵌套精确查询,排序功能有六种,界面可变色,里面已经附带50多本图书信息包括图书摘要等详细信息。里面还附带详细设计报告和解说PPt。(Pure C language programming simulation existing library borrow, renew, return book storage, a library queries, sorting and other functions, to achieve integrated management of electronic library wisdom. Precisely where the query function inside a nested query, sort function has six, the interface can change color, which has included more than 50 books including books summary information and other details. Which also included detailed design reports and commentary PPt.)
    2020-10-30 14:59:57下载
    积分:1
  • eightqueen
    利用數據結構中的棧,實現19世紀著名數學家高斯提出的八皇后問題(Stack data structure, to achieve the eight queens problem of the 19th century, the famous mathematician Gauss)
    2012-10-23 08:30:21下载
    积分: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
  • a-linked-list-and-related-processing
    链表的建立及相关处理,包括排序,删除,初始化,增加,删除等等,且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through )
    2014-01-13 23:56:27下载
    积分:1
  • xianxingbiaolianjie
    线性表的链接实现可利用单链表来实现,每个节点存储一个元素。 利用单链表来实现线性表的元素的插入,删除,修改等功能。 (Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)
    2011-04-26 11:57:25下载
    积分:1
  • zuixiaoshengchengshu
    最小生成树C语言程序,提供给喜欢编程以及数学建模的同学(Minimum spanning tree C language program)
    2015-02-08 20:15:45下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载