Sorting algorithms/Bubble sort: Difference between revisions

Content added Content deleted

Inline

Revision as of 18:04, 9 June 2008 (view source) Lupus (talk \| contribs) m (→‎{{header\|Fortran}}: code tweaks) ← Older edit		Revision as of 00:48, 23 August 2008 (view source) rosettacode>Mwn3d m (Redundant cat link) Newer edit →
Line 1:		Line 1:
	{{task}}{{Sorting Algorithm}}		{{task\|Sorting Algorithms}}{{Sorting Algorithm}}
	In this task, the goal is to sort an array of elements using the bubble sort algorithm. The elements must have a total order and the index of the array can be of any discrete type. For languages where this is not possible, sort an array of integers.		In this task, the goal is to sort an array of elements using the bubble sort algorithm. The elements must have a total order and the index of the array can be of any discrete type. For languages where this is not possible, sort an array of integers.