1 00:00:01,820 --> 00:00:06,260 ‫Welcome to Data Structures and Algorithms in C plus plus. 2 00:00:06,290 --> 00:00:13,550 ‫My name is Scott Barrett, and I have taught tens of thousands of students data structures and algorithms, 3 00:00:13,550 --> 00:00:19,130 ‫and my courses have some of the highest ratings on Udemy in this category. 4 00:00:19,340 --> 00:00:24,260 ‫So it doesn't matter if you're a self-taught programmer or a computer science student. 5 00:00:24,260 --> 00:00:27,260 ‫Data structures and algorithms are essential. 6 00:00:27,260 --> 00:00:32,900 ‫If you're trying to ace the coding interview or just trying to become a better developer, this is the 7 00:00:32,900 --> 00:00:34,570 ‫right course for you. 8 00:00:34,580 --> 00:00:39,920 ‫By the end of this course, you'll be able to confidently answer coding interview questions on data 9 00:00:39,920 --> 00:00:46,430 ‫structures and algorithms, as well as their time and space complexity, especially if you take the 10 00:00:46,430 --> 00:00:52,850 ‫time to complete the dozens and dozens of coding exercises that are included in the course. 11 00:00:53,180 --> 00:00:59,150 ‫I want to show you how this course is different from all of the other data structures and algorithms 12 00:00:59,150 --> 00:01:00,430 ‫courses out there. 13 00:01:00,440 --> 00:01:07,520 ‫Unlike other courses where you spend most of your time watching the instructor type code or write on 14 00:01:07,520 --> 00:01:14,960 ‫a whiteboard, I will be using these animations, which makes everything easier to understand, and 15 00:01:14,960 --> 00:01:17,560 ‫you can learn it in a fraction of the time. 16 00:01:17,570 --> 00:01:20,780 ‫So let me give you an example of how this works. 17 00:01:20,810 --> 00:01:25,250 ‫In this situation, we're adding an item to the end of a linked list. 18 00:01:25,280 --> 00:01:29,600 ‫We'll say tail next equals new node. 19 00:01:29,600 --> 00:01:39,170 ‫And if you don't know what that means, watch the animation that is tail next equals new node. 20 00:01:39,680 --> 00:01:42,440 ‫And then we'll say tail equals new node. 21 00:01:42,440 --> 00:01:47,720 ‫And that does that and adds that into our linked list. 22 00:01:47,720 --> 00:01:53,750 ‫And we'll use animations just like this to cover every topic in the course. 23 00:01:53,750 --> 00:02:00,590 ‫And those topics are going to include big O where we talk about both time and space complexity. 24 00:02:00,590 --> 00:02:07,790 ‫Then we move to the data structure section where we cover linked lists, doubly linked lists, stacks, 25 00:02:07,820 --> 00:02:12,830 ‫queues, binary search trees, hash tables and graphs. 26 00:02:13,190 --> 00:02:19,850 ‫Then after that, we move on to algorithms, where we start out with five different sorting algorithms. 27 00:02:19,850 --> 00:02:27,440 ‫First, in the section called basic sorts, we cover bubble sort, selection sort and insertion sort. 28 00:02:27,470 --> 00:02:33,950 ‫Then we move on to two sorting algorithms, which are generally more efficient but are more difficult 29 00:02:33,950 --> 00:02:38,260 ‫to write, and those are merge sort and quicksort. 30 00:02:38,270 --> 00:02:42,980 ‫After that we'll do tree traversal four different ways. 31 00:02:43,070 --> 00:02:45,710 ‫So we're going to cover a lot of material. 32 00:02:45,710 --> 00:02:48,050 ‫And a lot of it can be intimidating. 33 00:02:48,050 --> 00:02:53,450 ‫But with the animations it makes everything as simple as possible. 34 00:02:53,450 --> 00:02:58,280 ‫And that's what makes it where we can cover this in a fraction of the time. 35 00:02:58,280 --> 00:03:04,220 ‫This course is designed to be a completely different way to learn data structures and algorithms. 36 00:03:04,220 --> 00:03:06,350 ‫But don't just take my word for it. 37 00:03:06,380 --> 00:03:12,680 ‫I have included several preview videos so you can see the difference the animations make. 38 00:03:12,680 --> 00:03:14,480 ‫So what are you waiting for? 39 00:03:14,510 --> 00:03:22,670 ‫Find out why thousands of students have rated my courses five stars and see what you can do when you 40 00:03:22,670 --> 00:03:25,760 ‫learn data structures and algorithms.