登录
首页 » Visual C++ » sort

sort

于 2012-08-28 发布 文件大小:419KB
0 233
下载积分: 1 下载次数: 3

代码说明:

  自己编写的几种经典的排序算法,里面有自己做的PPT详细讲解,希望有帮助吧(I have written several classic sorting algorithm, which own PPT explain in detail, I hope to help!)

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

发表评论

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
  • Czhihen
    关于C语言的一些指针的处理算法,能够使得初学者对C语言指针有自己的了解(Some pointers on C language processing algorithms, it is possible to make a beginner C language pointer has its own understanding)
    2016-06-17 11:29:59下载
    积分:1
  • bfs
    这是BFS算法的实现。用C语言实现的。好好学习吧。(This is achieved BFS algorithm. Implemented using C language. Learn it.)
    2013-12-05 15:56:50下载
    积分:1
  • erchashu
    二叉树的链式存储、先序中序遍历和层次遍历。(构造一棵树并输入数据,编写三个函数,非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法(这里的非递归以中序为例)。在主程序中调用这三个函数进行树的遍历,观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。)(Chain store binary tree, preorder traversal and hierarchy traversal.)
    2013-12-07 23:16:06下载
    积分:1
  • stringmatch
    说明:  高速多字符串匹配程序,基于多字符串的KMP算法开发,能够实现多字符串的匹配(High-speed multi-string matching procedure, based on multi-string KMP algorithm development, to achieve multi-string match)
    2009-07-22 10:36:52下载
    积分:1
  • edge-betweenness
    计算边介数,复杂网络,中心性计算,介数也可以计算,运用了数据结构,计算大量数据(edge betweenness,complex network, centrality)
    2021-05-15 01:30:03下载
    积分: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
  • Kruskal
    克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针,a2是最小生成树边集的头指针,k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
    2009-06-27 01:43:39下载
    积分:1
  • sort.cpp
    各种排序的模板实现,并分析了各种实现的时间复杂度及改进办法(Templates of various sort, and analyze the time complexity of the various implementations and ways to improve)
    2012-04-14 03:08:18下载
    积分:1
  • 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
  • 696516资源总数
  • 106914会员总数
  • 0今日下载