Differences between current version and previous revision of BubbleSort.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 4 | Last edited on Sunday, August 24, 2003 2:08:19 pm | by AristotlePagaltzis | |
| Older page: | version 3 | Last edited on Sunday, August 24, 2003 2:07:27 pm | by AristotlePagaltzis | Revert |
@@ -1,5 +1,5 @@
-[BubbleSort] is the cannonical example of an inefficient sorting [Algorithm]. It works by moving through the array comparing each element with the next element and swapping them if they're in the wrong order. In each iteration, it moves the next largest element into the next last position, stopping one position earlier than previously. ThAn
example:
+[BubbleSort] is the cannonical example of an inefficient sorting [Algorithm]. It works by moving through the array comparing each element with the next element and swapping them if they're in the wrong order. In each iteration, it moves the next largest element into the next last position, stopping one position earlier than previously. An
example:
||After Iteration||||Element Nr.
|Outer|Inner|0|1|2|3
||^Initial state | D | B | C | A
