登录
首页 » Visual C++ » maopao_youhua

maopao_youhua

于 2012-04-18 发布 文件大小:1KB
0 217
下载积分: 1 下载次数: 2

代码说明:

  冒泡优化: 如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行,优化之后1次就好,也就是说序列越接近于正常序列,改进之后的冒泡排序的次数就越少,这样会给一个冒泡排序算法带了很大的效率。 思想:添加一个boolean变量用来判断冒泡是否是已经排好了顺序,如果boolean的值为false,说明是已经排好了,如果boolean的值true,说明没有排好,继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency. Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)

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

发表评论

0 个回复

  • QuickSort
    快速排序,用数组的存储结构,实现数的排序。共有八组随机数据,还能够计算出每组数据的处理时间,最终得到平均时间。(Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.)
    2013-03-22 21:21:16下载
    积分:1
  • Insert-and-delete-binary-sort-tree
    用c/c++写的二叉排序树的插入与删除,有兴趣的朋友可以看一下(Insertions and deletions using c/c++ to write binary sort tree)
    2015-01-22 14:24:13下载
    积分:1
  • linearlist
    说明:  线性链表的定义,遍历,查找,删除,排序。(Linear list definition, traversal, search, delete, sort.)
    2011-04-07 14:08:14下载
    积分:1
  • Map-four-staining
    用不多于四种颜色为地图染色,使相邻的行政区不重色,是计算机科学中著名的“四染色”的典型应用,应用这个思想,是以回溯的算法对一幅给定的地图染色。是对数据结构中栈的应用。(With no more than four colors map staining the adjacent borough is not heavy color, typical applications of computer science "stain" the application of this idea, a backtracking algorithm on a given mapstaining. The application of the stack data structure.)
    2012-12-05 13:20:37下载
    积分:1
  • AOV-Sort-Algorithm
    使用C语言编写的AOV网的拓扑排序,内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)
    2011-10-26 16:34:29下载
    积分:1
  • reverse
    本实验设有一个线性表,分别实现数组结构存储的原地逆置。为数据结构课程必做实验。(This experiment has a linear form, respectively, to achieve the storage array structure in situ reverse home. For the data structure courses will do the experiment.)
    2013-05-29 14:25:34下载
    积分: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
  • C++
    说明:  标准答案习题1 1.1 简述C++语言程序的结构特点。 答: (1)C++程序由一个或多个函数组成,其中至少有一个主函数main(),程序从主函数开始执行,由主函数来调用其他函数。(Standard answer to Exercise 11.1 on C++ Language program structural characteristics. Answer: (1) C++ Procedures by one or more functions, of which at least one of the main function main (), the procedure started from the main function, from the main function to call the other function.)
    2008-11-25 16:16:27下载
    积分:1
  • Monkeys-and-peach
    Monkeys and peach,Monkeys and peach(Monkeys and peach)
    2013-09-01 22:06:42下载
    积分:1
  • luowenfeng
    建立试题库文件,随机产生n个题目; 题目涉及加减乘除,带括弧的混合运算; 利用栈求解表达式的值; 随时可以退出; 保留历史分数,能回顾历史,给出与历史分数比较后的评价( The establishment of test database file, the subject of n randomly generated topics related to addition, subtraction, mixed operations with parentheses use the value of the expression stack solution ready to quit to preserve the historical scores, can look back at history, and history gives the comparison of scores Evaluation 保留历史分数,能回顾历史,给出与历史分数比较后的评价)
    2020-12-29 23:09:01下载
    积分:1
  • 696516资源总数
  • 106415会员总数
  • 3今日下载