Anonymous user
Sorting algorithms/Bubble sort: Difference between revisions
→{{header|Eiffel}}
(Added ZX81 BASIC) |
|||
Line 1,151:
Under normal circumstances, we would use the feature <code lang="eiffel">extend</code> (rather than <code lang="eiffel">put_front</code>) to add elements to the list.
This would assure that the order was maintained even as elements were added.
=={{header|Elena}}==
{{trans|C#}}
ELENA 3.2 :
<lang elena>import system'routines.
import extensions.
extension $op
{
bubbleSort
[
var list := self clone.
bool madeChanges := true.
int itemCount := list length.
while (madeChanges)
[
madeChanges := false.
itemCount -= 1.
0 till:itemCount do(:i)
[
if (list[i] > list[i + 1])
[
list exchange(i,i+1).
madeChanges := true.
]
]
].
^ list
]
}
program =
[
var list := (3, 7, 3, 2, 1, -4, 10, 12, 4).
console printLine(list bubbleSort).
].</lang>
{{out}}
<pre>
-4,1,2,3,3,4,7,10,12
</pre>
=={{header|Elixir}}==
| |||