Comments on: Computer Algorithms: Bubble Sort

By: Siyuan

Siyuan — Thu, 29 Aug 2013 07:51:12 +0000

Your implementation in the best case is still O(n^2), although no swaps is needed.
function bubble_sort($arr)
{
$length = count($arr);

for ($i = 0; $i $i; $j–) {
if ($arr[$j] < $arr[$j-1]) {
$t = $arr[$j];
$arr[$j] = $arr[$j-1];
$arr[$j-1] = $t;
$swapped = true;
}
}
if ($swapped == false)
break;
}

return $arr;
}

By: jbabe

jbabe — Mon, 11 Mar 2013 11:21:08 +0000

tnx sa info na ‘to. it helps me sa’king project

By: arjun

arjun — Mon, 11 Jun 2012 06:31:42 +0000

nice , explanation !!!
but provide a general algorithms to understand better >>>

By: Pablo

Pablo — Wed, 29 Feb 2012 21:05:52 +0000

The reason # 2 is false. In all programming languages I know (including JavaScript) the built-in sort function provides a way to pass in a custom function to decide if an item is smaller than other without change the underlying sorting algorithm.

By: Stoimen

Stoimen — Wed, 22 Feb 2012 15:27:41 +0000

Thanks, Adele!

By: adele

adele — Wed, 22 Feb 2012 15:26:35 +0000

Great article, Stoimen! As always!