Bubble sort: Difference between revisions

Revision as of 22:58, 27 May 2018

Bubblesort exchange algorithm is the simplest sorting algorithm.

Each element of the array is compared (and swapped if bigger) with every other element of the array.

The worst-case and average complexity is O(n²).


https://en.wikipedia.org/wiki/Bubble_sort

Revision as of 22:57, 27 May 2018 view source Savoundg (talk \| contribs) Bureaucrats, Administrators 945 edits No edit summary Tag: Visual edit ← Older edit		Revision as of 22:58, 27 May 2018 view source Savoundg (talk \| contribs) Bureaucrats, Administrators 945 edits No edit summary Tag: Visual edit Newer edit →
Line 1:		Line 1:
	Bubblesort algorithm is the simplest sorting algorithm.		Bubblesort exchange algorithm is the simplest sorting algorithm.

	Each element of the array is compared (and swapped if bigger) with every other element of the array.		Each element of the array is compared (and swapped if bigger) with every other element of the array.