DatenstrukturenUndAlgorithmen_Vo_20071018

DatenstrukturenUndAlgorithmen_Vo_20071018 - for i = 3 to n...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Fakultaet(n) if n=1 then return 1 else return(n*Fakultaet(n-1))
Background image of page 2
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
fibonacci(n) fib = 1 fir_1 = 1
Background image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: for i = 3 to n fib_2 =fib_1 fig_1 = fib fib = fib_1 + fib_2 return fib...
View Full Document

This note was uploaded on 11/19/2009 for the course HKJLHKJL 565 taught by Professor Fhfh during the Spring '09 term at University of Graz.

Page1 / 6

DatenstrukturenUndAlgorithmen_Vo_20071018 - for i = 3 to n...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online