‫Welcome to Data Structures and Algorithms in C plus plus.
‫My name is Scott Barrett, and I have taught tens of thousands of students data structures and algorithms,
‫and my courses have some of the highest ratings on Udemy in this category.
‫So it doesn't matter if you're a self-taught programmer or a computer science student.
‫Data structures and algorithms are essential.
‫If you're trying to ace the coding interview or just trying to become a better developer, this is the
‫right course for you.
‫By the end of this course, you'll be able to confidently answer coding interview questions on data
‫structures and algorithms, as well as their time and space complexity, especially if you take the
‫time to complete the dozens and dozens of coding exercises that are included in the course.
‫I want to show you how this course is different from all of the other data structures and algorithms
‫courses out there.
‫Unlike other courses where you spend most of your time watching the instructor type code or write on
‫a whiteboard, I will be using these animations, which makes everything easier to understand, and
‫you can learn it in a fraction of the time.
‫So let me give you an example of how this works.
‫In this situation, we're adding an item to the end of a linked list.
‫We'll say tail next equals new node.
‫And if you don't know what that means, watch the animation that is tail next equals new node.
‫And then we'll say tail equals new node.
‫And that does that and adds that into our linked list.
‫And we'll use animations just like this to cover every topic in the course.
‫And those topics are going to include big O where we talk about both time and space complexity.
‫Then we move to the data structure section where we cover linked lists, doubly linked lists, stacks,
‫queues, binary search trees, hash tables and graphs.
‫Then after that, we move on to algorithms, where we start out with five different sorting algorithms.
‫First, in the section called basic sorts, we cover bubble sort, selection sort and insertion sort.
‫Then we move on to two sorting algorithms, which are generally more efficient but are more difficult
‫to write, and those are merge sort and quicksort.
‫After that we'll do tree traversal four different ways.
‫So we're going to cover a lot of material.
‫And a lot of it can be intimidating.
‫But with the animations it makes everything as simple as possible.
‫And that's what makes it where we can cover this in a fraction of the time.
‫This course is designed to be a completely different way to learn data structures and algorithms.
‫But don't just take my word for it.
‫I have included several preview videos so you can see the difference the animations make.
‫So what are you waiting for?
‫Find out why thousands of students have rated my courses five stars and see what you can do when you
‫learn data structures and algorithms.