登录
首页 » Visual C++ » QUICKSORT

QUICKSORT

于 2015-01-12 发布 文件大小:1KB
0 108
下载积分: 1 下载次数: 3

代码说明:

  用C语言实现的普通快速排序,和随机快速排序进行对比(With ordinary C language implementation of quick sort, quick sort and compare the random)

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

发表评论

0 个回复

  • Hash-table
    本代码主要实现了哈希表的设计,完成了哈希函数的相关要求。(The code is designed to achieve a hash table, the completion of the relevant requirements of the hash function.)
    2013-12-30 17:15:14下载
    积分:1
  • xianxinglianbiao
    c语言编写链式线性表的初始化,创建,插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)
    2013-11-09 14:30:30下载
    积分: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
  • select
    采用Dijkstra算法和Floyd算法实现的简单医院选址系统(data structure)
    2009-03-11 20:23:09下载
    积分:1
  • bTree
    这是一个二叉树的工程文件,包括了工程文件里的所有文件。以及二叉树的构建,traverse,搜索等功能函数。(This file contains a summary of what you will find in each of the files that make up your bTree application. )
    2011-05-20 08:12:04下载
    积分:1
  • JGMFC
    一个MFC编的算法分析课程设计实验“重排九宫源码”(MFC compiled an algorithm analysis course design experiment " rearrangement kau kung source" )
    2010-03-11 16:13:32下载
    积分:1
  • arc
    运用二叉树求代数表达式的值,将代数表达式的每个符号用二叉树结点表示,遍历图的每一结点,按结点值得不同采用不同运算方式(Solving algebraic expressions binary tree)
    2012-06-23 19:52:38下载
    积分:1
  • box-nesting
    最长d维箱嵌套问题的贪心算法, 采用贪心算法不能得到整体最优解, 但其最终结果也可以是最优解的很好的近似(The Greedy Algorithm of the Longest Nesting of d一Dimenson Boxes)
    2012-06-11 16:47:23下载
    积分:1
  • HEAP
    poj 实现堆结构的源代码。。。话说其实没什么实际功能好么(poj achieve heap structure of the source code. . . In fact, the actual function of saying okay nothing)
    2013-11-21 23:03:15下载
    积分:1
  • crox
    矩形件最优排样的程序,用Visual C编写,在6.0下能正常运行。(Rectangular pieces Optimal Nesting program)
    2013-05-13 14:31:41下载
    积分:1
  • 696518资源总数
  • 104349会员总数
  • 32今日下载