冒泡排序

来源：互联网发布：dota视频软件编辑：程序博客网时间：2024/06/05 21:05

Java:

public int[] bubbleSort(int[] arr) {
        int temp;
        for (int i = arr.length - 1; i > 0; i--) {
            for (int j = 0; j < i; j++) {
                 if (arr[j + 1] > arr[j]) {
                     temp = arr[j];
                     arr[j] = arr[j + 1];
                     arr[j + 1] = temp;
                 }
           }
        }
      return arr;
}

JavaScript:

function bubbleSort(arr){ 
    vartemp;//先定义缓存
    for(vari=0;i<arr.length-1;i++){//前面的泡
        for(varJ=i+1;J<arr.length;J++){//后面的泡
                if(arr[i]>arr[J]){//若前泡>后泡
                       temp=arr[i];
                       arr[i]=arr[J];
                       arr[J]=temp;//交换
                   }
                 } 
        }
    returnarr;
}

PHP:

$a=array('3','8','1','4','11','7');
print_r($a);
$len = count($a);
//从小到大 
for($i=1;$i<$len;$i++)
{ 
    for($j=$len-1;$j>=$i;$j--)
        if($a[$j]<$a[$j-1])
        {//如果是从大到小的话，只要在这里的判断改成if($b[$j]>$b[$j-1])就可以了
            $x=$a[$j];
            $a[$j]=$a[$j-1];
            $a[$j-1]=$x;
         } 
}
Object-C:

- (void)bubbleSort:(NSMutableArray *)array
{ 
    inti, y; 
    BOOLbFinish = YES; 
    for(i = 1; i<= [array count] && bFinish; i++) { 
        bFinish = NO;
        for(y = (int)[array count]-1; y>=i; y--) {
            if ([[array objectAtIndex:y] intValue] < [[array objectAtIndex:y-1] intValue]) {
                [array exchangeObjectAtIndex:y-1 withObjectAtIndex:y]; 
                bFinish = YES; 
            } 
        }
  } 
} 
perl:
#! /usr/bin/perl -w
use strict; 
my @list = qw / 
3 5 6 2 12/; 
bubble_sort(\@list,scalar @list);
print "@list\n"; 
sub bubble_sort { 
    my$arrays_ref = shift;
    my$num = shift;
    for(my $i = 0; $i < $num - 1; $i++) { 
        for(my $j = 0; $j < $num - $i- 1; $j++) {
            if ($arrays_ref->[$j] >$arrays_ref->[$j-1]) {
                my $tmp = $arrays_ref->[$j];
                $arrays_ref->[$j] =$arrays_ref->[$j-1];
                $arrays_ref->[$j-1] =$tmp; 
            } 
        }
    }
    return$arrays_ref; 
}