Projects that are alternatives of or similar to recursion-and-dynamic-programming

Fatou sets in Julia (Fractals, Newton basins, Mandelbrot)

Stars: ✭ 92 (+148.65%)

Mutual labels: recursion, fractal-images, fractal-algorithms, fractals

SwiftUI-Fractals

The Sierpinski carpet, triangle, and a fractal tree using SwiftUI

Stars: ✭ 22 (-40.54%)

Mutual labels: recursion, sierpinski-triangle, sierpinski-carpet

Dsa Geeksclasses

DSA-Self Paced With Doubt Assistance Course Solutions in Python (Python 3)

Stars: ✭ 137 (+270.27%)

Mutual labels: recursion, dynamic-programming

Dynamic-Programming-Questions-by-Aditya-Verma

Aditya Verma (Youtube) DP Playlist Codes/Solutions.

Stars: ✭ 148 (+300%)

Mutual labels: recursion, knapsack-problem

Fractal-Inferno

An Online Fractal Flame Generator.

Stars: ✭ 41 (+10.81%)

Mutual labels: fractal-algorithms, fractals

Golang Examples

Some examples for the programming language Go.

Stars: ✭ 14 (-62.16%)

Mutual labels: recursion, palindrome

Algorithms

Free hands-on course with the implementation (in Python) and description of several computational, mathematical and statistical algorithms.

Stars: ✭ 117 (+216.22%)

Mutual labels: dynamic-programming, hanoi-towers

Data-Structures-Algorithms-Handbook

A series of important questions with solutions to crack the coding interview and ace it!

Stars: ✭ 30 (-18.92%)

Mutual labels: recursion, dynamic-programming

Cracking The Coding Interview

📚 C++ and Python solutions with automated tests for Cracking the Coding Interview 6th Edition.

Stars: ✭ 396 (+970.27%)

Mutual labels: recursion, dynamic-programming

algoexpert

AlgoExpert is an online platform that helps software engineers to prepare for coding and technical interviews.

Stars: ✭ 8 (-78.38%)

Mutual labels: recursion, dynamic-programming

Algo Tree

Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.

Stars: ✭ 166 (+348.65%)

Mutual labels: recursion, dynamic-programming

Project Euler Solutions

Runnable code for solving Project Euler problems in Java, Python, Mathematica, Haskell.

Stars: ✭ 1,374 (+3613.51%)

Mutual labels: recursion, dynamic-programming

topologic

Visualiser for basic geometric primitives and fractals in arbitrary-dimensional spaces

Stars: ✭ 39 (+5.41%)

Mutual labels: fractal-images, fractals

algorithms

Algorithms in python and C

Stars: ✭ 71 (+91.89%)

Mutual labels: palindrome, dynamic-programming

Algorithm-Patterns

面试常用算法框架分类总结，带你逐类击破 LeetCode 题目，培养算法思维，一通百通。Summary of Algorithm Patterns in coding interview. Cracking LeetCode and build up your algorithm thinking.

Stars: ✭ 24 (-35.14%)

Mutual labels: recursion, dynamic-programming

Algodeck

An Open-Source Collection of 200+ Algorithmic Flash Cards to Help you Preparing your Algorithm & Data Structure Interview 💯

Stars: ✭ 4,441 (+11902.7%)

Mutual labels: recursion, dynamic-programming

bbmandelbrotGo

generate images of a mandelbrot fractal

Stars: ✭ 19 (-48.65%)

Mutual labels: fractal-images, fractal-algorithms

Dynamics

A Compositional Object-Based Approach to Learning Physical Dynamics

Stars: ✭ 159 (+329.73%)

Mutual labels: recursion

StructDualDynProg.jl

Implementation of SDDP (Stochastic Dual Dynamic Programming) using the StructJuMP modeling interface

Stars: ✭ 22 (-40.54%)

Mutual labels: dynamic-programming

levenshtein.c

Levenshtein algorithm in C

Stars: ✭ 77 (+108.11%)

Mutual labels: edit-distance

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 😂 but it became entrepôt of my interest in fractal geometry 😋 I suppose I am pretty good at making lemonade when life gives me 🍋 (salute to Riley Reid 😝) 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 🖖