Algorithms the complete guide in 2020
You will start by learning about the complexity theory, then jump into learning about the numerical algorithms, including randomizing arrays, prime factorization, and numerical integration. From there, Rod will teach you about linked lists, such as singly-linked lists, sorted, and doubly-linked lists. This video tutorial also covers arrays, stacks, and queues, and sorting. You will also learn about searching, hash tables, recursion, and backtracking algorithms. Finally, you will cover trees, balanced trees, decision trees, and network algorithms.
Once you have completed this computer-based training course, you will be fully capable of analyzing and implementing algorithms, as well as be able to select the best algorithm for various situations. Working files are included, allowing you to follow along with the author throughout the lessons.
What Will I Learn?
- This course will lay a solid foundation on which you can develop and analyze your algorithms.
- You will learn to measure the performance of your algorithm in terms of the standard notations used in the industry.