| | |
Newmember with big problem!!!
![]() |
•
•
•
•
Originally Posted by thinhbk1802
Hi everybody. I have a problem with my program.
I want to make a program that can display the Fibonacci, but the number of term i must display is 2147483647. So there is a float number problem. How can i do it with fast speed.
Short answer is yes you can - but you need a big number library. If this is homework, as i suspect, the object of the assinement wud probably be to use strings to get that term.
So you have to think back to basic school arithmetic and addition on paper, i.e adding it column by column and carrying the surplus to the preceeding column.
Simple as pie.
>Speed
hmm, dunno about that. I'd say the speed would be the constant since you're adding rather than multiplying. multiplying can lend itself to varying speeds - Karatsuba etc.I'd imagine addition to be constant. But I cud be wrong. I'm sure sumone will prove this to be so. :rolleyes:
[Edit] Gotta love google, it would seem an efficient method does exist, he he [/Edit]
http://www.everything2.com/index.pl?node_id=1328208
*Voted best profile in the world*
![]() |
Similar Threads
- non blocking getchar.. big problem :( (C)
- BIG problem with STL List Container (C)
- Big Problem (Viruses, Spyware and other Nasties)
- BIG problem... laptop screen shaking/whiting out! (Monitors, Displays and Video Cards)
- Big Problem!!!!!!!!!!! (Viruses, Spyware and other Nasties)
- Big Problem, Generic Error (VB.NET)
- CommonName big problem (Windows NT / 2000 / XP)
Other Threads in the C Forum
- Previous Thread: pointer problems
- Next Thread: liner error
| Thread Tools | Search this Thread |
#include adobe api array arrays asterisks binarysearch calculate char cm copyanyfile copyimagefile copypdffile cprogramme creafecopyofanytypeoffileinc createcopyoffile createprocess() csyntax database directory dynamic feet fflush fgets file fork forloop frequency getlasterror givemetehcodez global graphics gtkgcurlcompiling hacking highest homework i/o inches include incrementoperators input interest kernel kilometer km linked linkedlist linux linuxsegmentationfault list locate logical_drives loopinsideloop. match matrix meter microsoft mqqueue mysql number odf open openwebfoundation owf pattern pdf performance pointer posix probleminc process program programming pyramidusingturboccodes radix read recursion recv repetition research scanf scheduling segmentationfault send sequential shape socket socketprograming socketprogramming stack standard string systemcall turboc unix user voidmain() wab win32api windows.h






