Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
D
ds_cs4bd_2324
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
s90907
ds_cs4bd_2324
Commits
6ffc7f9f
Commit
6ffc7f9f
authored
1 year ago
by
Sven Graupner
Browse files
Options
Downloads
Patches
Plain Diff
update D_recursion/README.md
parent
7ac20794
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
D_recursion/README.md
+11
-7
11 additions, 7 deletions
D_recursion/README.md
with
11 additions
and
7 deletions
D_recursion/README.md
+
11
−
7
View file @
6ffc7f9f
...
...
@@ -37,7 +37,7 @@ for recursions.
-
[
Challenge 4:
](
#4-challenge-powerset
)
Powerset
-
[
Challenge 5:
](
#5-challenge-find-matching-pairs
)
Find Matching Pairs
-
[
Challenge 6:
](
#6-challenge-combinatorial-problem-of-finding-numbers
)
Combinatorial Problem of Finding Numbers
-
[
Challenge 7:
](
#7-challenge-hard-problem-finding-numbers
)
Hard Problem Finding Numbers
-
[
Challenge 7:
](
#7-challenge-hard-problem-
of-
finding-numbers
)
Hard Problem
of
Finding Numbers
Points: [2, 1, 2, 2, 2, 3, 2, +4 extra pts]
...
...
@@ -114,13 +114,17 @@ Italian mathematician *Leonardo of Pisa*, later known as
introduced the sequence to Western European mathematics in his 1202 book
*[Liber Abaci](https://en.wikipedia.org/wiki/Liber_Abaci)*
.

Numbers of the
*Fibonacci sequence*
are defined as:
*fib(0): 0*
,
*fib(1): 1*
,
*...*
and each following number is the sum of the two preceding numbers.
Numbers of the
*Fibonacci sequence*
are defined as:
*fib(0): 0*
,
*fib(1): 1*
,
*...*
and each following
number is the sum of the two preceding numbers.
Fibonacci numbers are widely found in
*nature*
,
*science*
,
*social behaviors*
of
populations and
*arts*
, e.g. they form the basis of the
[
Golden Ratio
](
https://www.adobe.com/creativecloud/design/discover/golden-ratio.html
)
in
*painting*
and
*photography*
, see also this
[
1:32min
](
https://www.youtube.com/watch?v=v6PTrc0z4w4
)
video.
Fibonacci numbers are found in many places in nature, social behavior and arts
(
[
1:32min
](
https://www.youtube.com/watch?v=v6PTrc0z4w4
)
video).
<img
src=
"../markup/img/fibonacci.jpg"
alt=
"drawing"
width=
"600"
/>
<!--  -->
Complete functions
`fib(n)`
and
`fig_gen(n)`
.
...
...
@@ -424,7 +428,7 @@ Answer questions:
### 7.) Challenge: Hard Problem Finding Numbers
### 7.) Challenge: Hard Problem
of
Finding Numbers
Larger data sets can no longer be solved
*"brute force"*
by exploring all possible
2^n combinations.
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment