This documentation is available in two different themes. Press "Esc" to toggle between modes.
This documentation is available in two different themes. Press "Esc" to toggle between modes.
Home
Get Started
Introduction
Searches
The Big O Notation
Algorithms for Arrays and Lists
Recursion
Stacking
Sorting Algorithms
Hash Tables
Breadth First Search
Implementing Graphs
Dijkstra's Algorithm
Implementing Dijkstra's Algorithm
Dynamic Programming
In this documentation, I take you along with me and help you understand the basics of algorithms. I have written this documentation after reading and being inspired by Grokking
Algorithms by Aditya Bhargava. The algorithms mentioned further have been written in Python. However, pseudocode has been used at some places for those without any experience in programming languages.
Let's get started!
This documentation has been made with the intention of making algorithms understandable to any person, with or without any technical knowledge. I have converted nearly all the difficult topics, if not all, in the form of examples for easy comprehension. This documentation also uses day-to-day English and no strong vocabulary is required for understanding.
There are several code terminals used in this documentation. If, by chance, the entire code is not visible in the terminal, and gets cut off due to small size, try sliding along the terminal to view the entire code.
Get Started →