-
maopao_youhua
冒泡优化:
如果一个序列是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.)
- 2012-04-18 00:33:45下载
- 积分:1
-
Work3.5
上海交通大学数据结构课程的课后作业系列3.5:仅供参考,最好还是自己去写(Shanghai Jiaotong University data structure course homework Series 3.5: for reference, it is best to write their own)
- 2013-12-27 21:00:03下载
- 积分:1
-
xx
说明: 数据结构实验报告链表的操作,包括创建空链表、插入、删除节点等(Experimental Report list data structure operations, including creating an empty list, insert, delete nodes, etc.)
- 2009-11-25 08:36:26下载
- 积分:1
-
K_Merge
文件的多路归并排序算法, C++描述(要求待排序文件已经事先有序)(C++ implementation of K-Merge Algorithm)
- 2010-08-03 10:24:48下载
- 积分:1
-
最小生成树
给定一个带权的无向连通图,如何选取一棵生成树,使树上所有边上权的总和为最小(Given a weighted undirected connected graph, how to select a spanning tree to minimize the sum of all the upper bounds on the tree)
- 2017-06-05 17:27:17下载
- 积分:1
-
stack-link
简单的一个链栈.即用链表实现的一个栈。可以做简单的插入、删除、查找等操作(this is a simple C++ program )
- 2014-05-28 20:12:28下载
- 积分:1
-
EightQueens
数据结构与程序设计中的重点例子程序:八皇后问题(Data structure and procedures of the focus of the design example of the procedure: eight queen problem)
- 2009-06-29 14:52:11下载
- 积分:1
-
kruscal_Primspanningtree
最小生成树两种经典算法,kruscal和Prim算法(spanning tree)
- 2010-07-14 10:10:54下载
- 积分:1
-
vbsort
vb实现的排序算法演示vb实现的排序算法演示.冒泡、选择、折半等多种排序算法(vb sort demodemodemodemodemovb sort demodemodemodemodemo)
- 2011-10-09 10:21:28下载
- 积分:1
-
LongestIncreasingSequence
找出数组A中最长的递增序列的长度,使用动态规划算法,复杂度为O(N*N)。(Find the longest increasing sequence)
- 2011-09-05 17:36:27下载
- 积分:1