冒泡排序

冒泡排序-js

<script>
	var arr = [2,55,33,10,16,101,23,39,75,54,32,65,4,57,45,88,13];
	var t;
	for (var i = 0; i <= arr.length-1; i++) {
		for (var j = 0; j <= arr.length-1; j++) {
			if (arr[j]>arr[j+1]) {
				t = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = t;
			}
		}
	}
	console.log(arr);
</script>

冒泡排序-php

<?php
$arr = array(2,55,33,10,16,101,23,39,75,54,32,65,4,57,45,88,13);
for ($i=0; $i < count($arr)-1; $i++) { 
	for ($j=0; $j < count($arr)-1; $j++) { 
		if ($arr[$j]>$arr[$j+1]) {
			$t = $arr[$j];
			$arr[$j] = $arr[$j+1];
			$arr[$j+1] = $t;
		}
	}
}
echo json_encode($arr);

冒泡排序-java

public static void main(String[] args) {
	int[] arr = { 2, 55, 33, 10, 16, 101, 23, 39, 75, 54, 32, 65, 4, 57, 45, 88, 13 };
	int t;
	for (int i = 0; i < arr.length - 1; i++) {
		for (int j = 0; j < arr.length - 1; j++) {
			if (arr[j] > arr[j + 1]) {
				t = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = t;
			}
		}
	}
	System.out.println(Arrays.toString(arr));
}

原始数据:  [2,55,33,10,16,101,23,39,75,54,32,65,4,57,45,88,13]

排序后数据: [2,4,10,13,16,23,32,33,39,45,54,55,57,65,75,88,101]