Course update April 2021: Added Python code implementations for the Stack data structure, including a practical example that shows how to reverse a string.
This course provides a comprehensive overview of the concepts of algorithm analysis and development. I attempted to make the course as straightforward as possible, to the point where no previous experience in algorithm analysis or formal computer science education is required.
In the lessons, I review popular algorithms such as:
- Binary search trees
- Tree traversal and management
- Merge sort
- Counting sort
- Insertion sort
- Radix sort
- Huffman coding
- And much more
Additionally, you’ll learn about the data structures that are utilized to implement these algorithms, such as queues and stacks. I also review a number of graph algorithms and give introductions to additional advanced algorithm analysis concepts.
And based on course feedback, I’m now adding full Python based code implementations of the algorithms, so you can build and run the programs!
I developed this course while I was taking a graduate level Analysis of Algorithms and Data Structures course from Texas Tech University, and these are all the main topics that we discussed. So whether you are a university student looking to pass your algorithm and data structure class, or you are a developer looking to improve your computer science skills, this is the course for you.
Who this course is for:
- Computer science students
- No previous experience is required
Last Updated 4/2021
Comprehensive Algorithms.zip (717.7 MB) | Mirror
Comprehensive Algorithms.torrent (39 KB) | Mirror