阅读目录
- PHP
- Go
PHP
<?php
$arr = array(2,5,3,8,9);
function bSorts(array $arr){
for ($i=0; $i < count($arr); $i++) {
$data = "";
for ($j = $i; $j < count($arr)-1; $j++) {
if($arr[$i]>$arr[$j+1]){
$data = $arr[$i];
$arr[$i] = $arr[$j+1];
$arr[$j+1] = $data;
}
}
}
return $arr;
}
print_r(bSorts($arr));
PS E:\TEXT\test_go\one> php .\sort.php
Array
(
[0] => 2
[1] => 3
[2] => 5
[3] => 8
[4] => 9
)
PS E:\TEXT\test_go\one>
Go
go冒泡排序复杂度
- 时间复杂度为O(n^2)
- 空间复杂度为O(1)
package main
import "fmt"
func Bsorts(arr []int) []int {
for i := 0; i < len(arr)-1; i++ {
for j := 0; j < len(arr)-1-i; j++ {
if arr[j] > arr[j+1] {
arr[j], arr[j+1] = arr[j+1], arr[j]
}
}
}
return arr
}
func main() {
arr := []int{5, 6, 9, 1, 3}
fmt.Println(Bsorts(arr))
}
PS E:\TEXT\test_go\one> go run .\main.go
[1 3 5 6 9]
PS E:\TEXT\test_go\one>