Algorithms book for Professionals

Download free Algorithm tutorial course in PDF, training file in 56 chapters and 257 pages. Free unaffiliated ebook created from Stack OverFlow contributor.

Table of contents

• About
• Getting started with algorithms
• A sample algorithmic problem
• Getting Started with Simple Fizz Buzz Algorithm in Swift
• Algorithm Complexity
• Big-Theta notation
• Comparison of the asymptotic notations
• Big-Omega Notation
• Big-O Notation
• A Simple Loop
• A Nested Loop
• O(log n) types of Algorithms
• An O(log n) example
• Trees
• Typical anary tree representation
• Introduction
• To check if two Binary trees are same or not
• Binary Search Trees
• Binary Search Tree - Insertion (Python)
• Binary Search Tree - Deletion(C++)
• Lowest common ancestor in a BST
• Binary Search Tree - Python
• Check if a tree is BST or not
• Algorithm to check if a given binary tree is BST
• If a given input tree follows Binary search tree property or not
• Binary Tree traversals
• Level Order traversal - Implementation
• Pre-order, Inorder and Post Order traversal of a Binary Tree
• Lowest common ancestor of a Binary Tree
• Finding lowest common ancestor
• Graph
• Storing Graphs (Adjacency Matrix)
• Introduction To Graph Theory
• Storing Graphs (Adjacency List)
• Topological Sort
• Detecting a cycle in a directed graph using Depth First Traversal
• Thorup's algorithm
• Graph Traversals
• Depth First Search traversal function
• Dijkstra’s Algorithm
• Dijkstra's Shortest Path Algorithm
• A* Path?nding
• Introduction to A*
• A* Path?nding through a maze with no obstacles
• Solving 8-puzzle problem using A* algorithm
• Algorithm Complexity
• Trees
• Check if a tree is BST or not
• Lowest common ancestor of a Binary Tree
• Graph Traversals
• A* Pathfinding
• Dynamic Programming
• Kruskal's Algorithm
• Applications of Greedy technique
• Bellman–Ford Algorithm
• Floyd-Warshall Algorithm
• Multithreaded Algorithms
• Edit Distance Dynamic Algorithm
• Sorting
• Merge Sort
• Bucket Sort
• Counting Sort
• Cycle Sort
• Selection Sort
• Substring Search
• Depth First Search
• Travelling Salesman
• Equation Solving
• Longest Increasing Subsequence
• Pascal's Triangle
• Matrix Exponentiation
• Dynamic Time Warping
• Pseudocode

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