登录
首页 » Visual C++ » SelectSort

SelectSort

于 2012-09-27 发布 文件大小:844KB
0 194
下载积分: 1 下载次数: 3

代码说明:

  选择排序的实现,是一种基本的排序方法,但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)

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

发表评论

0 个回复

  • deep-copy
    该代码实现了深拷贝的问题,对于深拷贝进行了一系列的介绍,并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
    2014-01-03 10:46:48下载
    积分:1
  • Josephus(data_struct)
    数据结构中基于约瑟夫环问题,用C++方式实现的。。。。。(Data structure based on Josephus problem with C++ a manner. . . . .)
    2013-11-17 11:30:24下载
    积分:1
  • xiererfenchazhao
    希尔排序c++数据结构算法 二分查找的递归算法(希尔排序c++数据结构算法 二分查找的递归算法 )
    2010-12-10 18:32:52下载
    积分:1
  • ALGraph
    学数据结构自己总结的东西,希望对大家有所帮助。(Learn data structure sum things up, we want to help.)
    2013-03-08 19:50:18下载
    积分:1
  • SortDemo
    实现排序操作SortDemoSortDemo.rar,很不错的vc源码,希望对大家有所帮助。(To achieve the sorting operation SortDemo SortDemo.rar, very good vc source, we want to help.)
    2011-09-21 22:16:39下载
    积分:1
  • 48qqqq
    主要用栈和树求解骑士问题,用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)
    2009-03-21 22:34:39下载
    积分:1
  • Library
    数据结构课程设计 数据结构B+树 B+ tree Library(B+ tree Library)
    2009-05-18 14:07:25下载
    积分:1
  • CarClass
    数据结构简单的课程设计交通换乘算法,里面有零次换乘与一次换乘(Simple structure, curriculum design data traffic transfer algorithm, which have zero time transfer and a transfer)
    2011-01-09 10:33:14下载
    积分:1
  • Figure-topological-sort
    说明:  拓扑排序   对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任 意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。   通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。 注意:   ①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。   ②若图中存在有向环,则不可能使顶点满足拓扑次序。   ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )
    2011-03-22 17:19:14下载
    积分:1
  • Simulation-of-dendritic-growth
    模拟枝晶生长,在统计学常用的一种算法,对随机理论有帮助。(Simulation of dendritic growth, the statistics used an algorithm, the stochastic theory.)
    2012-04-06 19:12:14下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载