Comprehensive Algorithms

Enhance your understanding of algorithm analysis and data structures with comprehensive lessons and Python implementations. Perfect for students and developers alike.

  • Overview
  • Curriculum
  • Instructor
  • Review

Brief Summary

This course is all about understanding algorithms and data structures, even if you’re a total newbie. You’ll walk through some popular algorithms and learn how to code them in Python. It's fun and easy—perfect for students and developers alike!

Key Points

  • Comprehensive overview of algorithm analysis and development
  • No previous experience required
  • Popular algorithms covered: Binary search trees, Merge sort, Insertion sort, etc.
  • Introduction to data structures: queues and stacks
  • Includes Python implementations and practical examples

Learning Outcomes

  • Understand key algorithms like merge sort and Huffman coding
  • Implement algorithms using Python code
  • Gain familiarity with data structures like stacks and queues
  • Analyze and develop algorithms with confidence
  • Prepare for challenges in computer science courses or development projects

About This Course

This course provides a comprehensive overview of the concepts of algorithm analysis and development.

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.

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

Instructor

Profile photo of Jordan Hudgens
Jordan Hudgens

Jordan Hudgens is the CTO and Founder of Bottega where he leads instruction and curriculum development for all of the DevCamp and Bottega code schools around the US.As a full stack developer for over the past decade, Jordan has traveled the world building applications and training individuals on a variety of technology stacks, including: Ruby on Rails, Python, React JS,...

Review
4.9 course rating
4K ratings
ui-avatar of Sebastian Torres
Sebastian T.
5.0
6 years ago

Great Course

  • Helpful
  • Not helpful
ui-avatar of Omar Pasha
Omar P.
5.0
6 years ago

I learned a lot! Can't wait to finish it!!

  • Helpful
  • Not helpful
ui-avatar of Zachary Hill
Zachary H.
4.0
6 years ago

You never mention things as being "constant", "linear", "quadratic", "logarithmic", etc. If I had no exposure to those words before this course, I would be absolutely stumped if someone asked about "linear time". Great material, just might be worthwhile to mention them like that as well.

  • Helpful
  • Not helpful
ui-avatar of Vikram Sankhala
Vikram S.
5.0
6 years ago

An Excellent Course

  • Helpful
  • Not helpful
ui-avatar of Banuprathap Reddy P.R
Banuprathap R. P.
3.0
7 years ago

interest

  • Helpful
  • Not helpful
ui-avatar of nt 19
Nt 1.
5.0
7 years ago

High level intro, is what it says, real fast but useful to get a 1000 foot undesrtanding of algorithms and start your own learning

  • Helpful
  • Not helpful
ui-avatar of Vamsi Krishna
Vamsi K.
3.5
8 years ago

nice explanation

  • Helpful
  • Not helpful
ui-avatar of Steve Farrow
Steve F.
3.0
8 years ago

I liked his explanations about the different types of algorithms, but I wished there was more math or would of used more practical examples. To get a better understanding of how to use them in real life. His explanations of how they work is good though.

  • Helpful
  • Not helpful
ui-avatar of Roland Heintze
Roland H.
1.5
8 years ago

At least on the first lecture of complexities some more attention should be given to the graph. It doesn't have to be "to scale" to demonstrate O(n) should be a linear function. Draw that sucked at a 45% angle. Same with constant time, there should be no curve to the line since its derivative is 0.

  • Helpful
  • Not helpful
ui-avatar of Jonathan Cheth
Jonathan C.
5.0
8 years ago

good

  • Helpful
  • Not helpful
Leave A Reply

Your email address will not be published. Required fields are marked *

Ratings

Courses You May Like

Lorem ipsum dolor sit amet elit
Show More Courses