Skip to content

Commit 184b244

Browse files
committed
solve more problems about fibonancci
1 parent 5e9f8ea commit 184b244

File tree

1 file changed

+27
-0
lines changed

1 file changed

+27
-0
lines changed

README.md

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,31 @@
11
# Algorithms_DataStructure_Specialization
22
this is repo about my solutions of problems in Data Structures and Algorithms Specialization in coursera site from algorithmic toolbox to Genome Assembly Programming Challenge
33

4+
## Motivations to study it?
5+
6+
there are many reasons push me to spend good time with algorithms and their implementations
7+
- I love programming but programming languages themselves are just tools to implement ideas (algorithms)
8+
so I decide to learn more about the ideas themselves.
9+
10+
- I want to be an efficient and excellent programmer. so I searched on google and found that enough understandin of algorithms and data structure will make you an efficient programmer
11+
12+
- I love problem solving so I began solve problems on [codeforces](http://codeforces.com) but there are very hard problems that I could not solve them. After that I know that study algorithms will enable you to solve them
13+
14+
- algorithms are everywhere in digital tech. It is important to know albeit little about them
15+
- high companies request graduates who are good in algorithms.
16+
17+
## Courses and Their content
18+
19+
- [algorithms toolbox](https://www.coursera.org/learn/algorithmic-toolbox)
20+
- Week 1 : * stress testing : test your efficient algorithm vs your naive algorithms by generating rondom test cases. starting with small output and edge cases
21+
22+
* complexity notations : bigO() : upper limit of your algorithm
23+
Theta() : lower limit of your algorithm
24+
omega() : if algorithm upper limit equal lower limit
25+
26+
27+
- Week 2 : * Fibonancci Numbers and other maths Functions like gcd(), lcm()
28+
29+
30+
431

0 commit comments

Comments
 (0)