后端开发

递归写法package mainimport "fmt"func main() { fmt.Println(F(6))}func F(i int) (f int) { if i <= 0 { return 0 } if i == 1 { return 1 } return F(i-1) + F(i-2)}动规思路package mainimpo...

package mainimport "fmt"type A interface { Add() Update() ShowList()}type Item struct { no int name string nickname string next *Item}func main() { it := &Item{} //初...

package mainimport "fmt"func main() { bubbleSort() selectSort() insertSort()}func bubbleSort() { arr := []int{6, 3, 8, 2, 9, 1} length := len(arr) var flag bool for i := 0; i < lengt...

//$data=array(23,16,2,36,34,3,9,67,54); //$ref=$data[0]; //$count=count($data)-1; //qksort($data,0,$count); //$arr=other_qksort($data); //echo ""; //var_dump($arr); //echo ""; function quickSort($arr

$arr = array(31,59,26,80,56,11,77,54,34);$len = count($arr);for($i=0;$i for($j=0;$j if($arr[$j]>$arr[$j+1]){ $temp = $arr[$j]; $arr[$j]=$arr[$j+1]; $arr[$j+1] = $temp; } }echo "";var_dump($arr

function merge(&$arr,$p,$q,$r){ $n1 = $q-$p+1; $n2 = $r-$q; for ($i=0; $i $larr[$i] = $arr[$p+$i]; } for ($j=0; $j $rarr[$j] = $arr[$q+$j+1]; } $i=0; $j=0; $k=$p; //三个while是重点难点 while($i if(