Welcome to AlgoSolver’s documentation!

This library is a black box for developers to use to solve algorithms style problems.

Overview

My goal is to develop a library in python to help programmers solve a variety of algorithms style questions. For example, with Dynamic Programming problems the main things we need to know are if we are using a 1D of 2D array, what the base case is, and what the recurrence relation is. With this in mind, we can create multiple templates for different types of questions to take out the implementation process. I wanted to have a special focus on graph algorithms for the library. This will allow programmers to spend more of their time thinking about high level design questions.

Contents:

• Quick Guide
  • Overview
  • Installation
  • Usage
• Sorting Algorithm
  • bubble_sort()
  • bucket_sort()
  • counting_sort()
  • insertion_sort()
  • merge_sort()
  • quick_sort()
  • radix_sort()
• Searching Algorithm
  • binary_search()
  • selection_algo()
• Graph Algorithm
  • bfs()
  • dfs()
  • find_distance_unweighted_graph()
• Tutorial
  • Prerequisites
  • Example problem Number 1
  • Solution
  • Example problem Number 2
  • Solution
  • Example problem Number 3
  • Solution
• Contributing
  • Prerequisites
  • Cloning the Repo
  • Installing Dependencies
  • Before Opening a Pull Request (PR)