Computer ScienceScience & MathematicsEconomics & FinanceBusiness & ManagementPolitics & GovernmentHistoryPhilosophy

Algorithms Notes for Professionals

by Stack Overflow Community

Algorithms Notes for Professionals

Subscribe to new books via dBooks.org telegram channel

Join
DescriptionTable of ContentsDetailsHashtagsReport an issue

Book Description

The Algorithms Notes for Professionals book is compiled from Stack Overflow Documentation, the content is written by the beautiful people at Stack Overflow.

This open book is licensed under a Creative Commons License (CC BY-SA). You can download Algorithms Notes for Professionals ebook for free in PDF format (2.7 MB).

Table of Contents

Chapter 1
Getting started with algorithms
Chapter 2
Algorithm Complexity
Chapter 3
Big-O Notation
Chapter 4
Trees
Chapter 5
Binary Search Trees
Chapter 6
Check if a tree is BST or not
Chapter 7
Binary Tree traversals
Chapter 8
Lowest common ancestor of a Binary Tree
Chapter 9
Graph
Chapter 10
Graph Traversals
Chapter 11
Dijkstra's Algorithm
Chapter 12
A* Pathfinding
Chapter 13
A* Pathfinding Algorithm
Chapter 14
Dynamic Programming
Chapter 15
Applications of Dynamic Programming
Chapter 16
Kruskal's Algorithm
Chapter 17
Greedy Algorithms
Chapter 18
Applications of Greedy technique
Chapter 19
Prim's Algorithm
Chapter 20
Bellman-Ford Algorithm
Chapter 21
Line Algorithm
Chapter 22
Floyd-Warshall Algorithm
Chapter 23
Catalan Number Algorithm
Chapter 24
Multithreaded Algorithms
Chapter 25
Knuth Morris Pratt (KMP) Algorithm
Chapter 26
Edit Distance Dynamic Algorithm
Chapter 27
Online algorithms
Chapter 28
Sorting
Chapter 29
Bubble Sort
Chapter 30
Merge Sort
Chapter 31
Insertion Sort
Chapter 32
Bucket Sort
Chapter 33
Quicksort
Chapter 34
Counting Sort
Chapter 35
Heap Sort
Chapter 36
Cycle Sort
Chapter 37
Odd-Even Sort
Chapter 38
Selection Sort
Chapter 39
Searching
Chapter 40
Substring Search
Chapter 41
Breadth-First Search
Chapter 42
Depth First Search
Chapter 43
Hash Functions
Chapter 44
Travelling Salesman
Chapter 45
Knapsack Problem
Chapter 46
Equation Solving
Chapter 47
Longest Common Subsequence
Chapter 48
Longest Increasing Subsequence
Chapter 49
Check two strings are anagrams
Chapter 50
Pascal's Triangle
Chapter 51
Algo:- Print a m*n matrix in square wise
Chapter 52
Matrix Exponentiation
Chapter 53
polynomial-time bounded algorithm for Minimum Vertex Cover
Chapter 54
Dynamic Time Warping
Chapter 55
Fast Fourier Transform
Appendix A
Pseudocode

Book Details

Title
Algorithms Notes for Professionals
Subject
Computer Science
Publisher
GoalKicker
Published
2019
Pages
257
Edition
1
Language
English
PDF Size
2.7 MB
License
CC BY-SA

Book Hashtags

Related Books

.NET Framework Notes for Professionals
The .NET Framework Notes for Professionals book is compiled from Stack Overflow Documentation, the content is written by the beautiful people at Stack Overflow....
Angular 2+ Notes for Professionals
The Angular 2+ Notes for Professionals book is compiled from Stack Overflow Documentation, the content is written by the beautiful people at Stack Overflow....
AngularJS Notes for Professionals
The AngularJS Notes for Professionals book is compiled from Stack Overflow Documentation, the content is written by the beautiful people at Stack Overflow....
C++ Notes for Professionals
The C++ Notes for Professionals book is compiled from Stack Overflow Documentation, the content is written by the beautiful people at Stack Overflow....
C# Notes for Professionals
The C# Notes for Professionals book is compiled from Stack Overflow Documentation, the content is written by the beautiful people at Stack Overflow....
Entity Framework Notes for Professionals
The Entity Framework Notes for Professionals book is compiled from Stack Overflow Documentation, the content is written by the beautiful people at Stack Overflow....