Зарегистрироваться
Восстановить пароль
FAQ по входу

Algorithms Notes for Professionals

  • Файл формата pdf
  • размером 2,65 МБ
  • Добавлен пользователем
  • Отредактирован
Algorithms Notes for Professionals
GoalKicker.com, 2018. — 256 p.
Автор и выходные данные не указаны.
The Algorithms Notes for Professionals book is compiled from Stack Overflow Documentation, the content is written by the beautiful people at Stack Overflow. Text content is released under Creative Commons BY-SA. See credits at the end of this book whom contributed to the various chapters. Images may be copyright of their respective owners unless otherwise specified.
Book created for educational purposes and is not affiliated with Algorithms group(s), company(s) nor Stack Overflow. All trademarks belong to their respective company owners.
Chapters:
Getting started with algorithms
Algorithm Complexity
Graph
Graph Traversals
Dijkstra’s Algorithm
A* Pathfinding
A* Pathfinding Algorithm
Dynamic Programming
Kruskal's Algorithm
Greedy Algorithms
Applications of Greedy technique
Prim's Algorithm
Bellman–Ford Algorithm
Line Algorithm
Floyd-Warshall Algorithm
Catalan Number Algorithm
polynomial-time bounded algorithm for Minimum Vertex Cover
Multithreaded Algorithms
Knuth Morris Pratt (KMP) Algorithm
Edit Distance Dynamic Algorithm
Online algorithms
Big-O Notation
Sorting
Bubble Sort
Merge Sort
Insertion Sort
Bucket Sort
Quicksort
Counting Sort
Heap Sort
Cycle Sort
Odd-Even Sort
Selection Sort
Trees
Binary Search Trees
Check if a tree is BST or not
Binary Tree traversals
Lowest common ancestor of a Binary Tree
Searching
Substring Search
Breadth-First Search
Depth First Search
Hash Functions
Travelling Salesman
Knapsack Problem
Matrix Exponentiation
Equation Solving
Longest Common Subsequence
Longest Increasing Subsequence
Dynamic Time Warping
Pascal's Triangle
Fast Fourier Transform
Algo:- Print a m*n matrix in square wise
Check two strings are anagrams
Applications of Dynamic Programming
  • Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.
  • Регистрация