Comprehensive Algorithms

What you'll learn
By the end of this course you will have a thorough understanding of some of the most popular algorithms and data structures
Requirements
No previous experience is required
Description
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 treesTree traversal and managementMerge sortCounting sortInsertion sortRadix sortHuffman codingAnd much moreAdditionally, 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.
Overview
Section 1: Introduction to Algorithms
Lecture 1 Course Overview
Lecture 2 Growth of Functions
Section 2: Sorting Algorithms
Lecture 3 Insertion Sort
Lecture 4 Counting Sort
Lecture 5 Radix Sort
Lecture 6 Merge Sort
Section 3: Abstract Data Structures
Lecture 7 Stacks
Lecture 8 Code Implementation of the Stack Data Structure in Python
Lecture 9 Practical Stack Data Structure Example: Reversing a String in Python
Lecture 10 Queues
Section 4: Binary Search Trees
Lecture 11 Binary Search Tree Introduction
Lecture 12 Searching Through a Binary Search Tree
Lecture 13 How to Construct a Binary Search Tree
Lecture 14 How to Delete a Node from a Binary Search Tree
Lecture 15 Preorder Binary Tree Traversal
Lecture 16 Postorder Binary Tree Traversal
Section 5: Red Black Trees
Lecture 17 Properties of Red Black Trees
Lecture 18 Red Black Tree Traversal
Lecture 19 How to Rotate a Red Black Tree Data Structure
Lecture 20 How to Delete a Node from a Red Black Tree
Section 6: Graph Algorithms
Lecture 21 Hamiltonian vs Euler Paths
Lecture 22 Prim's Algorithm
Lecture 23 Breadth First Search
Lecture 24 Depth First Search
Section 7: Advanced Algorithms
Lecture 25 Huffman Codes
Lecture 26 Introduction to Greedy Algorithms
Lecture 27 Greedy Algorithm for Shortest Path Problem
Lecture 28 How to Develop a Good Hash Function
Section 8: Supplementary Content
Lecture 29 How to Implement a Factorial in the Ruby Programming Language
Computer science students,Programmers,Mathematicians


Homepage

https://www.udemy.com/course/comprehensive-algorithms/