幸运小侯子

感觉好久之前不写这些基础的东西忽然觉着，想复习一下，就简单温习一下排序的例子 package com.ruishenh.algoritmic; public class Sort { public static void main(String[] args) { // 冒泡排序 int[] arrs=getRandomArrs(20000); // print

shell-awk [houchangren@ebsdi-23260-oozie shell]$ vim awk/fun_fibonacci2.awk ind =3' ind++; BEGIN{ function fibonacci(array,n,ind){ ind =3; while(ind<=n){ array[ind]=array[ind-1]+array[ind-2]; ind++