https://github.com/je-suis-tm/recursion-and-dynamic-programming
Julia and Python recursion algorithm, fractal geometry and dynamic programming applications including Edit Distance, Knapsack (Multiple Choice), Stock Trading, Pythagorean Tree, Koch Snowflake, Jerusalem Cross, Sierpiński Carpet, Hilbert Curve, Pascal Triangle, Prime Factorization, Palindrome, Egg Drop, Coin Change, Hanoi Tower, Cantor Set, Fibonacci
https://github.com/je-suis-tm/recursion-and-dynamic-programming
dynamic-programming edit-distance fractal-algorithms fractal-geometry fractal-images fractals hanoi-towers hilbert-curve julia-training knapsack knapsack-problem koch-snowflake learning-julia palindrome pascal-triangle recursion recursive-algorithm sierpinski-carpet sierpinski-triangle tabulation
Last synced: 2 months ago
JSON representation
Julia and Python recursion algorithm, fractal geometry and dynamic programming applications including Edit Distance, Knapsack (Multiple Choice), Stock Trading, Pythagorean Tree, Koch Snowflake, Jerusalem Cross, Sierpiński Carpet, Hilbert Curve, Pascal Triangle, Prime Factorization, Palindrome, Egg Drop, Coin Change, Hanoi Tower, Cantor Set, Fibonacci
- Host: GitHub
- URL: https://github.com/je-suis-tm/recursion-and-dynamic-programming
- Owner: je-suis-tm
- License: apache-2.0
- Created: 2018-04-03T05:06:07.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2023-07-19T17:57:25.000Z (almost 2 years ago)
- Last Synced: 2025-04-13T09:13:35.617Z (2 months ago)
- Topics: dynamic-programming, edit-distance, fractal-algorithms, fractal-geometry, fractal-images, fractals, hanoi-towers, hilbert-curve, julia-training, knapsack, knapsack-problem, koch-snowflake, learning-julia, palindrome, pascal-triangle, recursion, recursive-algorithm, sierpinski-carpet, sierpinski-triangle, tabulation
- Language: Julia
- Homepage:
- Size: 976 KB
- Stars: 61
- Watchers: 4
- Forks: 13
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Recursion and Dynamic Programming
## Intro
On par with many of my repositories, this one didn’t start off with great ambition either. It was merely an archive of LeetCode problems and solutions. For a problem like edit distance, there are two approaches – memoization (top down, solve big problem then the smaller ones) and tabulation (bottom up, solve small problem then the bigger ones). Conventionally, memoization approach is called recursion and tabulation approach is called dynamic programming. They used to be the core features of this repository.
Oddly enough, this repository didn’t help me beat any interview related to recursion or dynamic programming :joy: but it became entrepôt of my interest in fractal geometry :yum: I suppose I am pretty good at making lemonade when life gives me :lemon: (salute to Riley Reid :stuck_out_tongue_closed_eyes:) Jokes aside, a fractal is a mathematical set that exhibits a repeating pattern that displays at every scale. It can be modeled by using recursive algorithms or L-systems techniques. Fractal patterns will be the core feature of this repository in the foreseeable future.
Whether you are here for algorithm and data structure or for the niche branch of geometry, I sincerely hope this repository helps you along the way, and perhaps boldly take you somewhere you have never gone before :vulcan_salute:
## Recursion
* Edit Distance (Julia, Python)
* Pascal Triangle (Julia, Python)
* Prime Factorization (Julia, Python)
* Stock Trading (Julia, Python)
## Fractal Geometry
* Hilbert Curve (Julia, Python)
* Jerusalem Cross (Julia, Python)
* Koch Snowflake (Julia, Python)
* Pythagorean Tree (Julia, Python)
* Sierpiński Carpet (Julia, Python)
* Sierpiński Triangle (Julia, Python)
## Dynamic Programming
* Edit Distance (Julia, Python)