Time and Space Complexity (Sorting Algorithms Mini-Series - Episode 1)

Today we cover the broad topic of Time and Space Complexity as it relates to Sorting Algorithms. We go over what Time and Space Complexity's are, how we measure them for a particular algorithm, and the most common types of equations that get returned back to us.
-----------------------------------------------
Time Stamps:
0:00 Introduction
1:29 Time Complexity
5:43 Space Complexity
7:42 BigO Notation
9:32 O(1)
10:13 O(log n)
11:55 O(n)
12:26 O(n log n)
12:49 O(n^2)
-----------------------------------------------
------------------------------------------------
Sources for today's Episode:
-----------------------------------------------------------------
NullPointerException is a YouTube channel created by two high-schoolers in hopes of creating high-quality tutorial and how-to's relating to computer science and programming. Videos can range from basic language tutorials, specific programming how-to's, and even some AP course review when the time hits. If this at all interests you, consider subscribing to expand your programming knowledge.

[ipadeolabamidele]

How smooth and flawless you talk about the concepts, making irresistible to keep watching till the end! God bless you sir

[peppermintdior]

This is the best series for Sorting Algorithms on Youtube.
Love from India ♥

[stephenhemingway]

This is the first time that I understand this topic. Thanks!

[JB-ikyf]

Hey, thanks so much for these videos. I watched and took notes on the entire Intro to Data Structures video....took hours over several days to do it, but it’s worth it. Have also started watching this series and taking notes along with it. Question: with the data structures, these sorting algorithms, etc., where do you go with the knowledge you’ve gained from the videos/how do you apply it? Should we be practicing creating and manipulating these DS and Algorithms in the language of our choice? For example, I now know what a Heap is and understand the concept of a Min/Max Heap thanks to your great videos, but what should I be doing to solidify that knowledge? How do I put it into practice? Should I be learning to create these structures and algorithms using small examples in my IDE until I have a decent handle on them? I guess I feel like it’s like reading a book and learning the syntax of a language. It’s great, but you don’t really learn the language and how to piece things together until you start writing functions or small programs, etc. Should I be starting to make these on my own for practice? If so, any language specific resources on how to do so? For instance, I’ve been learning Python for 4-5 months and pretty much eat, drink, and sleep code, so I’ve made a lot of progress in a short time. How can I create a Linked List in Python? I’ve written classes to create the functionality of a stack and a queue with lists in Python, but wouldn’t know where to begin with creating a Doubly Linked List class(well, maybe a deque?). So yeah, I guess I’m asking where to go from here? Sorry for the long message. Thanks for the great content. It’s super helpful for someone like me who is extremely committed, but doesn’t have the opportunity to go back to school for a CS education.

[gravitypapa]

Your channel is the best. Greetings from Argentina.

[shubhamsagar]

thanks bro for the
but i gotta ask you one question ..so I try to solve questions on competetive programming sites like hacker rank but i can't seem to understand the question and logic does not click....so is it normal or i have to hang in there and try again and again...coz ...i just dont get competetive programming