Sorting algorithms/Bubble sort: Difference between revisions

Content added Content deleted
(optimize others)
Line 110: Line 110:
{
{
done = true ;
done = true ;
--size;
for( INDEX_TYPE i = 0 ; i < size - 1 ; i++ )
for( INDEX_TYPE i = 0 ; i < size ; i++ )
{
{
if( array[i] > array[i+1] )
if( array[i] > array[i+1] )
Line 311: Line 312:
my $temp = 0;
my $temp = 0;
my $done = 0;
my $done = 0;
my $elements = $#list + 1;
my $elements = $#list;
while ($done == 0) {
while ($done == 0) {
$done = 1;
$done = 1;
$elements--;
for (my $i = 0; $i < $elements; $i++) {
for (my $i = 0; $i < $elements; $i++) {
if ($list[$i] > $list[$i + 1] && ($i + 1) < $elements) {
if ($list[$i] > $list[$i + 1]) {
$done = 0;
$done = 0;
$temp = $list[$i];
$temp = $list[$i];
Line 339: Line 341:
while not(done) do
while not(done) do
true -> done;
true -> done;
for i from 1 to n - 1 do
n - 1 -> n;
for i from 1 to n do
if v(i) > v(i+1) then
if v(i) > v(i+1) then
false -> done;
false -> done;