Recently Added Algorithms

• Rabin-Karp Algorithm

  Rabin-Karp is a string searching algorithm that uses hashing to quickly compare a pattern with parts of a text using a rolling hash technique.

• Z-Algorithm

  Z-Algorithm is a string searching algorithm that uses a preprocessed array to find all occurrences of a pattern within a main string. It is particularly useful for finding all occurrences of a pattern in a long string, as it allows for efficient searching and multiple match detection.

• Knuth–Morris–Pratt Algorithm

  KMP is a string searching algorithm that finds all occurrences of a pattern in a text efficiently by avoiding re-checking characters using a prefix table.

• Decision Tree (ID3 / CART)

  A Decision Tree builds a flowchart-like structure that splits data step by step using features, until it can make a clear prediction.

• Dinic's Algorithm

  Dinic's Algorithm finds the maximum flow in a network by building layers using BFS and then sending flow using DFS in these layers, making it faster than simpler methods.

About This Project

I built this platform to help you explore and understand software algorithms in a simple and approachable way. You can browse, search, and filter algorithm examples explained in plain language, no confusing jargon.

This project was inspired by the original idea from Max Lund Madeleine. The content here is supported by mathematicians, physicists, and software developers who share the same goal: making complex ideas easy to understand.

My goal is to make learning algorithms faster, clearer, and more enjoyable. If you have any suggestions; hit me up!