Algorithms Notes for Professionals
Publisher: Goalkicker.com 2018
Number of pages: 257
Description:
Contents: Getting started with algorithms; Algorithm Complexity; Big-O Notation; Trees; Binary Search Trees; Graph; Dijkstra's Algorithm; A* Pathfinding; Dynamic Programming; Kruskal's Algorithm; Greedy Algorithms; Catalan Number; Sorting; Searching; Pascal's Triangle; etc.
Download or read it online for free here:
Download link
(2.6MB, PDF)
Similar books
![Book cover: Algorithms for Programmers: Ideas and Source Code](images/1310.jpg)
by Jorg Arndt
Aimed to programmers who are interested in the selected algorithms and those who want to create optimized code. It covers low level algorithms, combinatorial generation, fast orthogonal transforms, fast arithmetic, and algorithms for finite fields.
(23135 views)
![Book cover: Sorting and Searching Algorithms: A Cookbook](images/1512.jpg)
by Thomas Niemann
Collection of algorithms for sorting and searching, and techniques for implementing dictionaries, with brief and intuitive descriptions. It is assumed that you know C, and that you are familiar with concepts such as arrays and pointers.
(19336 views)
![Book cover: Matters Computational: Ideas, Algorithms, Source Code](images/4329.jpg)
by Joerg Arndt
This is a book for a working programmer or anyone interested in methods of computation. The focus is on material that does not usually appear in textbooks on algorithms. We use the C++ programming language for low-level algorithms.
(18028 views)
![Book cover: Sequential and Parallel Sorting Algorithms](images/3645.jpg)
by H. W. Lang - FH Flensburg
From the table of contents: insertion sort, quicksort, heapsort, mergesort, shellsort, lower bounds, external sorting, sorting networks, sorting on mesh-connected processor arrays, sorting contest. Explanations are followed by source code.
(21500 views)