+//Copyright (C) 2012 Eric Chen(G+ page:HencriceFOSS, gmail:hencrice+FOSS+introtoalgorithm3ed@gmail.com)

+//This file is a part of introtoalgorithm3ed.

+//introtoalgorithm3ed is a free software; you can redistribute it and/or modify it under the terms of the GNU General

+//Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option)

+//This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the

+//implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public

+//License for more details.

+//You should have received a copy of the GNU General Public License along with this source file; if not, write to the

+//Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA

+//Task: Find the number of inversions in the file given.

+//The file contains all the 100,000 integers between 1 and 100,000 (including both) in some random order(no integer is repeated).

+ Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2,

+ the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

+ By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the

+ /*I find that Fibonnacci sequence has a pattern beginning from 3, namely, (odd,odd,even),(odd,odd,even)......

+ 3, 5, 8, 13, 21, 34, 55, 89, ...

+ o, o, e, o , o, e, o ,o, e

+ var a,b,temp,evenSum,ooeCount uint32=1,2,0,2,0

+ for i := 0; i < 50; i++ {

+ fmt.Printf("Bigger than 4 million: %d, %d\n",temp,temp%2)

+ fmt.Printf("evenSome increase to:%d\n",evenSum)

+ fmt.Printf("%d, %d\n",temp,temp%2)

+ fmt.Printf("Final evenSum=%d\n",evenSum)