je-suis-tm/recursion-and-dynamic-programming：Julia 和 Python 递归算法、分形几何以及动态规划

Apache License 2.0

项目介绍

je-suis-tm/recursion-and-dynamic-programming 是一个托管在 GitHub 上的开源项目，主要使用 Julia 编写，采用 Apache License 2.0 许可证，目前获得 66 个 Star、15 次 Fork。

仓库全名: je-suis-tm/recursion-and-dynamic-programming
开源许可证: Apache License 2.0
Star 数: 66
Fork 数: 15

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…

完整内容见 GitHub 原始 README 或本页。

常见问题

recursion-and-dynamic-programming 用什么语言开发？

主要使用 Julia 编写，采用 Apache License 2.0 许可证，目前有 66 个 Star。

recursion-and-dynamic-programming 可以免费商用吗？

如何获取 recursion-and-dynamic-programming 的源码？

可以直接克隆仓库：git clone https://github.com/je-suis-tm/recursion-and-dynamic-programming.git，默认分支为 master；安装与运行步骤见仓库 README。

recursion-and-dynamic-programming 最近还在维护吗？

仓库最近一次更新为 2023年7月20日，当前没有未关闭的 Issue；Star 数为 66，可作为社区活跃度的参考。

关于

GitHub 原始描述

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

描述取自 GitHub 官方 API，保持仓库作者书写的原文。

简要分析

热度分

价值分

活跃状态

活跃

GitHub

语言占比

Julia

Python

贡献者

je-suis-tm

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

Coin Change (Julia, Python)
Edit Distance (Julia, Python)
Fibonacci (Julia, Python)
Hanoi Tower (Julia, Python)
Palindrome (Julia, Python)
Pascal Triangle (Julia, Python)
Prime Factorization (Julia, Python)
Stock Trading (Julia, Python)

Fractal Geometry

Cantor Set (Julia, Python)

alt text

Hilbert Curve (Julia, Python)

alt text

Jerusalem Cross (Julia, Python)

alt text

Koch Snowflake (Julia, Python)

alt text

Pythagorean Tree (Julia, Python)

alt text

Sierpiński Carpet (Julia, Python)

alt text

Sierpiński Triangle (Julia, Python)

alt text

Dynamic Programming

Coin Change (Julia, Python)
Edit Distance (Julia, Python)
Egg Drop (Julia, Python)
Knapsack (Julia, Python)
Knapsack Multiple Choice (Julia, Python)
Stock Trading (Julia, Python)

recursion-and-dynamic-programming

项目介绍

README 摘要

常见问题

相关仓库

关于

简要分析

语言占比

贡献者

README

Recursion and Dynamic Programming

Intro

Recursion

Fractal Geometry

Dynamic Programming

评论