Sorting Algorithm - Revision history

Tom.Reding: +{{Redirect category shell}} using AWB

2017-06-05T05:14:54Z

+{{Redirect category shell}} using AWB

← Previous revision		Revision as of 05:14, 5 June 2017
Line 1:		Line 1:
	#REDIRECT [[Sorting algorithm]] {{R from other capitalisation}}		#REDIRECT [[Sorting algorithm]]

			{{Redirect category shell\|1=
			{{R from other capitalisation}}
			}}

2012-12-31T12:50:56Z

← Previous revision	Revision as of 12:50, 31 December 2012
(No difference)

2007-12-13T19:35:02Z

← Previous revision		Revision as of 19:35, 13 December 2007
Line 1:		Line 1:
	#REDIRECT [[Sorting algorithm]]		#REDIRECT [[Sorting algorithm]] {{R from other capitalisation}}

2004-07-05T15:16:34Z

2002-06-20T15:50:16Z

fix double redirect

2002-02-25T15:51:15Z

Automated conversion

← Previous revision	Revision as of 15:51, 25 February 2002
(No difference)

2001-09-25T00:36:15Z

← Previous revision		Revision as of 00:36, 25 September 2001
Line 1:		Line 1:
			#REDIRECT [[Sorting algorithm]]
	A <b>sorting algorithm</b> is an [[algorithm]] that puts elements of a list into order. Efficient sorting is important to optimizing the use of other algorithms (such as [[search algorithm]]s) that operate best on sorted lists.



	<p>Many common sorting algorithms are used in [[computer science]]. They vary in [[computational complexity]] and in usage of memory and other computer resources.



	<p>Some sorting algorithms are:

	<ul>

	<li>[[Bubble sort]]

	<li>[[Shell sort]]

	<li>[[Quicksort]]

	<li>[[Merge sort]]

	<li>[[Radix sort]]

	</ul>

2001-09-24T23:43:12Z

← Previous revision		Revision as of 23:43, 24 September 2001
Line 1:		Line 1:
	An algorithm ~~which~~ puts elements of ~~information in~~ a ~~given~~ order. ~~A known~~ ~~implementation~~ is [[~~bubble~~ ~~sort~~]] in ~~[[C~~ ~~Plus~~ ~~Plus\|C++]]~~.		A <b>sorting algorithm</b> is an [[algorithm]] that puts elements of a list into order. Efficient sorting is important to optimizing the use of other algorithms (such as [[search algorithm]]s) that operate best on sorted lists.



			<p>Many common sorting algorithms are used in [[computer science]]. They vary in [[computational complexity]] and in usage of memory and other computer resources.



			<p>Some sorting algorithms are:

			<ul>

			<li>[[Bubble sort]]

			<li>[[Shell sort]]

			<li>[[Quicksort]]

			<li>[[Merge sort]]

			<li>[[Radix sort]]

			</ul>

2001-08-18T16:35:42Z

New page

An algorithm which puts elements of information in a given order. A known implementation is [[bubble sort]] in [[C Plus Plus|C++]].