 Название: Algorithms Notes for Professionals
Автор: Stack Overflow Contributors
Издательство: Stack Overflow Contributors
Год: 2018
Страниц: 257
Язык: английский
Формат: pdf (true), djvu
Размер: 10.19 MB
This 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.
This is an unofficial free book created for educational purposes and is not affiliated with official Algorithms group(s) or company(s) nor Stack Overflow. All trademarks and registered trademarks are the property of their respective company owners.
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
Скачать Algorithms Notes for Professionals
|
Навигация
Вход на сайт
Реклама
Algorithms Notes for Professionals 
