Free Algorithms eBook

Table of contents

• About
• Getting started with algorithm
• Remarks
• Introduction to Algorithms
• Examples
• A sample algorithmic problem
• Getting Started with Simple Fizz Buzz Algorithm in Swift
• A* Pathfinding
• Examples
• Introduction to A*
• Solving 8-puzzle problem using A* algorithm
• A* Pathfinding through a maze with no obstacles
• A* Pathfinding Algorithm
• Introduction
• Examples
• Simple Example of A* Pathfinding: A maze with no obstacles
• Algo:- Print a m*n matrix in square wise
• Introduction
• Examples
• Sample Example
• Write the generic code
• Algorithm Complexity
• Remarks
• Work
• Span
• Examples
• Big-Theta notation
• Big-Omega Notation
• Formal definition
• Notes
• A* Pathfinding
• Algo:- Print a m*n matrix in square wise
• Applications of Dynamic Programming
• Bellman–Ford Algorithm
• Binary Search Trees
• Breadth-First Search
• Bucket Sort
• Check if a tree is BST or not
• Counting Sort
• Depth First Search
• Dynamic Programming
• Edit Distance Dynamic Algorithm
• Fast Fourier Transform
• Graph
• Greedy Algorithms
• Heap Sort
• Integer Partition Algorithm
• Knuth Morris Pratt (KMP) Algorithm
• Line Algorithm
• Longest Increasing Subsequence
• Matrix Exponentiation
• Maximum Subarray Algorithm
• Multithreaded Algorithms
• Online algorithms
• Pascal's Triangle
• polynomial-time bounded algorithm for Minimum Vertex Cover
• Pseudocode
• Radix Sort
• Selection Sort
• Shortest Common Supersequence Problem
• Sorting
• Substring Search
• Travelling Salesman
• Trees

It is a free Algorithm ebook created for beginners. The content is extracted from Stack Overflow pltaform, which is written by many Algorithm developers and contributors.

The content is released under Creative Commons BY-SA