|
In my Intro to Computer Systems class (it's a cs class where you learn how the cpu and stuff works in order to better understand how to write better and faster code) we had to learn basic asm and gdb to order to extract "passwords" and perform buffer overflow exploits for homework. I think it's made me a better programmer, but I would never write asm unless it's necessary. Even in our current optimization assignment, we are using pure C and use our knowledge on how the complier works to get the asm code we want. Anyways, I'm kinda biased to say that knowing asm is good for debugging purposes and just understanding how everything works (or writing an OS kernal :P).
Anyways, what's hanging you up with the algorithm? You can do the basic recursion/loop method to get F(n+1) = F(n) + F(n-1). You can also calculate it "directly" by using the explicit formula which is all over the net. The reason i write explicit in quotes is because it would use floating point numbers which would give you rounding and thus would not give you the right answer (hmm maybe if you just rounded to an int it probably would work)
__________________
sometimes it just takes a cat
|