遇见--专栏

public static void MaoPaoSort(){ int ret = 0; int[] intArray = { 10,0,20,50,12,32,89,10,21}; for (int i = 0; i < intArray.Length - 1;i++ ) {

//// /// /// 斐波那契数列,递归算法 /// /// 第num位数的值 /// public static int FbnqSort(int num) { if (num <= 0) return 0;

using System;using System.Collections.Generic;using System.Linq;using System.Text;namespace ConsoleApplication1{ class Program { static void Main(string[] args) {