HOME > Development > Comprehensive Algorithms

Comprehensive Algorithms

  • Development
  • May 15, 2025
SynopsisComprehensive Algorithms, available at $49.99, has an average...
Comprehensive Algorithms  No.1

Comprehensive Algorithms, available at $49.99, has an average rating of 4.3, with 29 lectures, based on 67 reviews, and has 2903 subscribers.

You will learn about By the end of this course you will have a thorough understanding of some of the most popular algorithms and data structures This course is ideal for individuals who are Computer science students or Programmers or Mathematicians It is particularly useful for Computer science students or Programmers or Mathematicians.

Enroll now: Comprehensive Algorithms

Summary

Title: Comprehensive Algorithms

Price: $49.99

Average Rating: 4.3

Number of Lectures: 29

Number of Published Lectures: 29

Number of Curriculum Items: 29

Number of Published Curriculum Objects: 29

Original Price: $19.99

Quality Status: approved

Status: Live

What You Will Learn

  • By the end of this course you will have a thorough understanding of some of the most popular algorithms and data structures
  • Who Should Attend

  • Computer science students
  • Programmers
  • Mathematicians
  • Target Audiences

  • Computer science students
  • Programmers
  • Mathematicians
  • 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.

    Course Curriculum

    Chapter 1: Introduction to Algorithms

    Lecture 1: Course Overview

    Lecture 2: Growth of Functions

    Chapter 2: Sorting Algorithms

    Lecture 1: Insertion Sort

    Lecture 2: Counting Sort

    Lecture 3: Radix Sort

    Lecture 4: Merge Sort

    Chapter 3: Abstract Data Structures

    Lecture 1: Stacks

    Lecture 2: Code Implementation of the Stack Data Structure in Python

    Lecture 3: Practical Stack Data Structure Example: Reversing a String in Python

    Lecture 4: Queues

    Chapter 4: Binary Search Trees

    Lecture 1: Binary Search Tree Introduction

    Lecture 2: Searching Through a Binary Search Tree

    Lecture 3: How to Construct a Binary Search Tree

    Lecture 4: How to Delete a Node from a Binary Search Tree

    Lecture 5: Preorder Binary Tree Traversal

    Lecture 6: Postorder Binary Tree Traversal

    Chapter 5: Red Black Trees

    Lecture 1: Properties of Red Black Trees

    Lecture 2: Red Black Tree Traversal

    Lecture 3: How to Rotate a Red Black Tree Data Structure

    Lecture 4: How to Delete a Node from a Red Black Tree

    Chapter 6: Graph Algorithms

    Lecture 1: Hamiltonian vs Euler Paths

    Lecture 2: Prims Algorithm

    Lecture 3: Breadth First Search

    Lecture 4: Depth First Search

    Chapter 7: Advanced Algorithms

    Lecture 1: Huffman Codes

    Lecture 2: Introduction to Greedy Algorithms

    Lecture 3: Greedy Algorithm for Shortest Path Problem

    Lecture 4: How to Develop a Good Hash Function

    Chapter 8: Supplementary Content

    Lecture 1: How to Implement a Factorial in the Ruby Programming Language

    Instructors

  • Comprehensive Algorithms  No.2
    Jordan Hudgens
    CTO at Bottega Code School
  • Rating Distribution

  • 1 stars: 3 votes
  • 2 stars: 2 votes
  • 3 stars: 16 votes
  • 4 stars: 16 votes
  • 5 stars: 30 votes
  • Frequently Asked Questions

    How long do I have access to the course materials?

    You can view and review the lecture materials indefinitely, like an on-demand channel.

    Can I take my courses with me wherever I go?

    Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!