aboutsummaryrefslogtreecommitdiff
path: root/help-fibonacci.pd
diff options
context:
space:
mode:
authorKjetil S. Matheussen <ksvalast@users.sourceforge.net>2004-01-08 14:55:24 +0000
committerKjetil S. Matheussen <ksvalast@users.sourceforge.net>2004-01-08 14:55:24 +0000
commit44bc5a27d53124ba82becd4181fc381053c56fdb (patch)
tree4695439f8508017260cad061ad6505d5a7200d4c /help-fibonacci.pd
First commit of k_vst~, k_guile and k_cextsvn2git-root
svn path=/trunk/externals/k_cext/; revision=1253
Diffstat (limited to 'help-fibonacci.pd')
-rw-r--r--help-fibonacci.pd12
1 files changed, 12 insertions, 0 deletions
diff --git a/help-fibonacci.pd b/help-fibonacci.pd
new file mode 100644
index 0000000..38cd194
--- /dev/null
+++ b/help-fibonacci.pd
@@ -0,0 +1,12 @@
+#N canvas 0 0 450 300 10;
+#X floatatom 51 143 5 0 0 0 - - -;
+#X floatatom 49 231 10 0 0 0 - - -;
+#X obj 50 174 k_cext 1 1 \; IF I(0)< 30 THEN DO \; . O(0 \, INT_fib(I(0)))
+\;;
+#X text 216 177 Set a limit on 30 \, because of;
+#X text 215 192 the computing time.;
+#X text 43 27 The simplest way to find the fibonacci numbers.;
+#X obj 49 62 k_cfunc INT_fib int n \; IF n<2 THEN DO \; . return n
+\; ELSE \; . return INT_fib(n-1)+INT_fib(n-2) \;;
+#X connect 0 0 2 0;
+#X connect 2 0 1 0;