
	Where results make sense

Topic: Sorting algorithm

Related Topics

Bucket sort

Selection sort

Quicksort

Bead sort

Cocktail sort

Introsort

Patience sorting

Pancake sorting

Smoothsort

Counting sort

Bubble sort

Merge sort

Insertion sort

Comb sort

Radix sort

In the News (Sun 15 Nov 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	PlanetMath: in-place sorting algorithm
		A sorting algorithm is said to be in-place if it requires very little additional space besides the initial array holding the elements that are to be sorted.
		Of course, the efficiency of any algorithm will depend on how the data is stored; usually, the elementary discussion of sorting algorithms focuses on sorting elements stored in a contiguous array (which has constant-time access and swap operations but takes a long time to do shifts).
		Sorting methods taking advantage of the structure of keys (say, they are strings) can be much faster both asymptotically and in practice; they are generally not in-place, but the extra space is often worth the time advantage.
	www.planetmath.org /encyclopedia/InPlaceSortingAlgorithm.html (574 words)

	PlanetMath: stable sorting algorithm
		Some examples of stable sorting algorithms are bubblesort and mergesort (although the stability of mergesort is dependent upon how it is implemented).
		Some examples of unstable sorting algorithms are heapsort and quicksort (quicksort could be made stable, but then it wouldn't be quick any more).
		This is version 6 of stable sorting algorithm, born on 2002-03-07, modified 2007-07-10.
	www.planetmath.org /encyclopedia/StableSortingAlgorithm.html (187 words)

	Sorting Algorithms
		Some sorting algorithms are simple and intuitive, such as the bubble sort.
		Algorithmic complexity is a complex subject (imagine that!) that would take too much time to explain here, but suffice it to say that there's a direct correlation between the complexity of an algorithm and its relative efficiency.
		Algorithmic complexity is generally written in a form known as Big-O notation, where the O represents the complexity of the algorithm and a value n represents the size of the set the algorithm is run against.
	linux.wku.edu /~lamonml/algor/sort/sort.html (696 words)

	Sorting Algorithms Demo
		This means that the algorithms do not allocate additional storage to hold temporary results: they sort the data in place.
		Radix Sort Algorithm (by Alvin Raj) LinkedQueue.java and intNode.java
		As the algorithms are explained, references to related algorithms and mathematical or experimental analyses are given.
	www.cs.ubc.ca /spider/harrison/Java/sorting-demo.html (527 words)

	Citations: An optimal sorting algorithm for mesh connected computers - Schnorr, Shamir (ResearchIndex)
		Sorting algorithms for the MESH are well known, 6, 10, 3] the most efficient one requiring (8.
		More recently, Krizanc [3] presented the first deterministic sorting algorithm in a similar model that overcomes the 3 p N Gamma o(p N) bound given that input is drawn from integers in the A preliminary version of this paper....
		The new algorithm appears to be much faster than the 8m sorting algorithm (due to Schimmler) used in [1] and its local control is very simple compared to the complicated recursive algorithms that achieve the 3m step lower bound on mesh sorting (cf.
	citeseer.ist.psu.edu /context/772/0 (3158 words)

	Sorting Algorithms \| Sig9
		Sorting in general refers to various methods of arranging or ordering things based on criterias (numerical, chronological, alphabetical, heirarchial etc.).
		Hence the sorting process basically consists of extracting the root node and reheaping the remaining set of elements to obtain the next largest element till there are no more elements left to heap.
		Heap sort is one of the preferred sorting algorithms when the number of data items is large.
	sig9.com /articles/sorting-algorithms (1518 words)

	A Faster Sorting Algorithm - ABCsort
		Whether it's bubble sort, insertion sort, merge sort, shell sort, selection sort, heap sort, tree sort, or quick sort, they all try to optimize compares, and their uniqueness lies in the way that they handle compares.
		The algorithm is linear in speed: it examines each character in the file AT MOST ONCE, so there is no logarithm in any of the formulas; the algorithm is O(N) in both space and time.
		This output function receives sorted results not all at once at the end, but rather it receives sorted results one by one as the keys are being sorted.
	www.beechick-sort.bizhosting.com (1366 words)

	Sorting algorithm Summary
		Efficient sorting is important to optimizing the use of other algorithms (such as search and merge algorithms) that require sorted lists to work correctly; it is also often useful for canonicalizing data and for producing human-readable output.
		Sorting algorithms are prevalent in introductory computer science classes, where the abundance of algorithms for the problem provides a gentle introduction to a variety of core algorithm concepts, such as big O notation, divide-and-conquer algorithms, data structures, randomized algorithms, best, worst and average case analysis, time-space tradeoffs, and lower bounds.
		Quicksort is a divide and conquer algorithm which relies on a partition operation: to partition an array, we choose an element, called a pivot, move all smaller elements before the pivot, and move all greater elements after it.
	www.bookrags.com /Sorting_algorithm (3981 words)

	Sorting
		Sorting is also used to illustrate the standard paradigms of algorithm design.
		If it is important that your sort be stable, it is probably better to explicitly use the initial position as a secondary key rather than trust the stability of your implementation.
		Algorithm 410 [Cha71] and Algorithm 505 [Jan76] of the Collected Algorithms of the ACM are Fortran codes for sorting.
	www2.toki.or.id /book/AlgDesignManual/BOOK/BOOK4/NODE148.HTM (1561 words)

	Sorting Algorithm
		The efficiency of a given algorithm depends on the data set that it is being used on.
		The best case, which describes how the algorithm works under the best conditions, the worst case, which is how it works under the worst conditions, and the average case, which is considered to be the most common situation.
		Since the algorithms have to compare the magnitude of different elements and move things around, counting the number of comparisons needed and the number of exchanges made are good measures of performance.
	www2.hawaii.edu /~dnishio/SortingAlgorithm.htm (729 words)

	Sorting
		Merge sort and quick sort are different examples of divide and conquer, a very general algorithm design technique in which one partitions an input into parts, solves the parts recursively, then recombines the subproblem solutions into one overall solution.
		Sorting algorithms have a range of time bounds, but for some reason there are two typical time bounds for comparison sorting: mergesort, heapsort, and (the average case of) quicksort all take O(n log n), while insertion sort, selection sort, and the worst case of quicksort all take O(n^2).
		Suppose you have a sorting algorithm that only examines the data by making comparisons between pairs of objects (and doesn't use any random numbers; the model we describe can be extended to deal with randomized algorithms but it gets more complicated).
	www.ics.uci.edu /~eppstein/161/960116.html (2715 words)

	Robsort Sorting Algorithm
		Robsort in a GNU public license sorting algorithm devleloped by Robert Thompson.
		Scientists have calculated the robsort algorithm to approach an order of [n!] (n factorial) inefficiency, however this inefficiency could only theoretically be obtained by using truly random numbers.
		Robsort is used as a benchmark for measuring algorithm efficiency, it is the benchmark by which all other sorting algorithms are measured.
	www.robsort.org (535 words)

	Visibility Sorting
		Given a viewpoint for visibility sorting, the MPVO algorithm gives directionality to each edge based on which side of the associated face is facing the viewpoint.
		Max, Hanrahan, and Crawfis show that the sorting of the power distances between the viewpoint and the circumspheres of the tetrahedra in a Delaunay triangulation is equivalent to the visibility sorting of the tetrahedra.
		9] provide an algorithm to create valid sets of spheres for general meshes, but their algorithm is complex and not guaranteed to work for all meshes.
	www.cs.unm.edu /~kmorel/documents/dissertation/thesis_full/node31.html (1143 words)

	Radix Sort Algorithm Report
		There are many sorting algorithms in existence nowadays and this report examines in detail one of the most popular and commonly used among them the radix sort algorithm.
		Unlike most of the other sorting methods that treat numbers to be sorted as whole, the radix sorting algorithm works with individual digits of the numbers, or in the case of strings, with individual alphabetical characters.
		The radix sort algorithm is of O(2(n)(d)) order of magnitude whereas n is a number of keys to be sorted and d represents the length of a bytes that constitute the key.
	www2.hawaii.edu /~lejla/RadixAlgorithmReport.html (1612 words)

	Sorting
		We can analyze various algorithms to determine their complexity--that is, how fast they run as a function of the size of the input.
		This algorithm can be improved by noticing that after one pass over the array, the largest element must have "bubbled" down to its correct position in a[n-1] (the last element in a).
		The mergesort algorithm is based on a problem-solving technique known as divide and conquer--to take a problem, break it up into smaller problems that are easier to solve, and then synthesize solutions to the simpler problems into a solution to the big problem.
	cba.winthrop.edu /thackerw/csci208/LabHandouts/sorting.htm (917 words)

	Sorting
		he objective of the sorting algorithm is to rearrange the records so that their keys are ordered according to some well-defined ordering rule.
		Algorithms that need enough extra memory space to hold another copy of the array to be sorted.
		Based on the result of this comparison, the sorting algorithm may perform some calculation which we are not interested in and will eventually perform another comparison between two other elements of input sequence, which again will have two outcomes.
	www.personal.kent.edu /~rmuhamma/Algorithms/MyAlgorithms/Sorting/sortingIntro.htm (481 words)

	Dr. Dobb's \| The Fastest Sorting Algorithm? \| April 1, 2000
		If you don't use the full power of the RAM model, but only consider sorting algorithms that operate by comparing elements pairwise, it's well known that at least n log n comparisons are needed to sort n elements in the worst case.
		If the algorithm is simple enough, it may be possible to simulate the parallelism using the inherent parallel nature of bitwise logical operations.
		The algorithm is based on a property of so called "bitonic sequences." A bitonic sequence is almost sorted: It is the concatenation of an ascending and a descending sequence, or it can be obtained by a rotation (cyclic shift) of such a sequence.
	www.ddj.com /184404062?pgno=8 (2133 words)

	4. Non-Adaptive Sorting: Batcher's Algorithm
		We can sort left and right sets of m keys, then odd and even, and then do the last round of even odd comparisons and switches.
		The algorithm is even easier than this sounds, because after we sort the left and right halves of the keys, the left and right halves of both the even and the odd keys are already sorted, so we do not have sort lefts and rights in sorting the even and odd keys..
		The algorithm for this is not what we have been describing but it is easier.
	www-math.mit.edu /18.310/non_adaptive_sorting.html (1373 words)

	The Sorting Algorithm Demo
		Bubble Sort is a sequential algorithm, with an average case time of O(n
		Quick Sort is a sequential algorithm, with an average case time of O(n log n).
		Odd-Even Transposition Sort is a parallel algorithm, with an worst case time of O(n), running on n processors.
	www.cs.rit.edu /~atk/Java/Sorting/sorting.html (161 words)

	New sorting algorithm
		The fact that he's trying to beat Radix sort (assuming his is a general sorting algorithm that has no knowledge of the data, and can only get results of >, < and =) leads me to believe he doesn't understand sorting algorithms that well in the first place.
		Imagine a sorting algorithm that was ultra efficient in both speed (perhaps linear) and in memory usage that would be Ninja Sort, the ultimate sorting algorithm.
		Sorting isn't as dead as many believe though 1995 an article that produced an algorithm that sorted in O(n log log n) (For what they exactly mean, read more yourself, it's rather complex).
	forum.java.sun.com /thread.jspa?threadID=587353&tstart=0 (960 words)

	Sorting Algorithm Introduction
		In the computer science problem of sorting, the input is an array of numbers and the output must be the same numbers arranged in non-decreasing order.
		First, many applications require sorting of a large number of items (telephone books, tax records, etc.) so the efficiency of a sorting algorithm can be very important.
		Each algorithm will have three sections: an introduction which will give pseudocode and a basic explanation of the algorithm, an exploration which will use animations of the algorithm to discover its subtleties and, finally, investigations in the run-time analysis of the algorithm.
	webspace.ship.edu /cawell/Sorting (916 words)

	VB Helper Tutorial: Sorting It Out
		Sorting using trees is generally pretty fast, but there are many other sorting algorithms that are less complicated and some of them, like countingsort, are much faster.
		Algorithm books spend a great deal of time on sorting algorithms.
		Quicksort is a recursive algorithm that uses a divide-and-conquer technique.
	www.vb-helper.com /tut1.htm (3013 words)

	Cprogramming.com - Sorting Algorithm Comparison
		Sorting algorithms are usually judged by their efficiency.
		In this case, efficiency refers to the algorithmic efficiency as the size of the input grows large and is generally based on the number of elements to sort.
		Some algorithms never require extra space, whereas some are most easily understood when implemented with extra space (heap sort, for instance, can be done in place, but conceptually it is much easier to think of a separate heap).
	www.cprogramming.com /tutorial/computersciencetheory/sortcomp.html (613 words)

	DM's Esoteric Programming Languages
		Abacus Sort - a sorting algorithm based on the abacus.
		Demon Sort - a sorting algorithm that violates the second law of thermodynamics.
		Hanoi Sort - a sorting algorithm based on the Tower of Hanoi.
	www.dangermouse.net /esoteric (181 words)

	Sorting
		This is another simple sorting algorithm, which is based on the principle used by card players to sort their cards.
		This divide and conquer algorithm is, in the average case, the fastest known sorting algorithm for large values of N.
		Sort them (by direct comparison) so that the median of the three is in a[middle] and the largest is in a[right].
	web.mit.edu /1.124/LectureNotes/sorting.html (1734 words)

Try your search on: Qwika (all wikis)