@@aboxinspace Ditto. I am revisiting it 2 years later and I am just amazed how well it explained the concepts in just ten minutes. It helps though having studied it before in my opinion though.
the videos always seem like a compressed version of my first two years of studying computer science. though not as thorough as the lectures back then, these videos really hold up and explain everything extremely well. great job!
Data structures was my favorite subject in my CS courses in college! It all just makes so much sense, and thinking about how each piece of data relates to all the others is like a fun puzzle.
Dear Carrie Anne and crashcourse, I hope you're seeing this. You are all amazing. Thanks so much for making these very good quality videos and keeping them for free. I'm considering supporting you after I'm done with binge watching the entire series. I'll definitely recommend this series to others. I'm impressed. You're amazing.
I'm learning to Program now, and surprisingly understood everything. Had to stop and scroll back a few times, but that was a beautifully clear explanation of each concept!
For anyone who may just be starting to learn low level languages, be careful when using "NUL" vs "NULL" because they can mean two different things. "NUL" refers to the NUL character or ASCII zero. "NULL" refers to a null pointer - a reference to a non-existent location in memory.
Always great folks but that was pretty much an entire term's class-worth of data structures in 10 mins. It'd be fascinating to know how many people who encountered this for the first time kept up! As a side-note it's really good how you refer everything back to memory locations. So often these days people are taught to use data structures as basic language building blocks with no idea what's going on "under the hood". So, object orientation next week? :-)
Yep, nice but very, very concentrated. As I was listening I too thought that it might be hard to follow or even a bit misleading for a person new to the material. Universal referents and particular implementations got a bit tangled up. Still, an impressive effort given the time constraint.
In my college is the opposite, and we had to build a Java class implementing the basic of each and one of the structures that the video showns. For example in an exam I had we needed to implement a funcion in a binary tree in wich we pass an array of numbers in any order and then the numbers got stored in the tree in order.
+Pepys Thanks, maybe my criticism was misplaced. I suspected that people would watch that and think "oh, that's what a sting ~is~" rather than "that's one good way to implement a string." Your mention of C# jumped out at me since it is an example of a language that does strings differently than presented. Sorry that I misinterpreted your programming experience.
Many CrashCourse episodes are like crammed with a little too much info to get in one pass. Sociology for example. I tended to work with languages that were weak in data structures so I had to create my own with strings. Slow, but a great way to learn about data structures. (Hint: the secret is to have a delimiter character for each dimension that is never included in the data content.)
I'm a computer engineer and I'm doing some Java stuff for like 5 years, and this video gave me the envy to go back doing some C again, like I did back at school. And I like that.
You said in the beginning you weren't gonna go into programming yet I feel like I've learned a ton about the fundamentals of code languages and where programming happens. You tricked me into learning way too much!
You basically covered last semester programing course in a 10 min video, I am impressed. But it might be too much information for people who are seeing the topic for the first time.
one thing left out in this otherwise really good overview is the main disadvantage of linked lists: random access (that is, getting the value at a certain index into the list) becomes much more difficult, and is much less efficient than in simple arrays. each data structure has its tradeoffs and use cases
0:44 list != array An list uses pointers to get to the next index. An array uses ons block of memory. Meaning that a list is faster if you are iterating over the shops structure, but An array is better of you need to het a specific indexeert element.
A lot of programming languages are very particular about the type of data you give to a function, whereas more flexible ones can accept multiple types. The trade off is inflexibility against precision.
The main drawback is that miss-typing isn't caught until the system tries to do an operation expecting one type and you give it another. Static typing generally catches this before any of your code gets run. Even worse is when the system preforms a different operation because it's a different type. The first time I used python, 10 < 5.
God I love crash course :) I only wish you made actual courses on this subject. I am a currently earning my BS in CS and I absolutely love to talk about data structures. Programming is my blood. However, there are so many techniques and different ways to structure your data that I want to know everything I can.
strcat = string catenation catenation and concatenation are synonyms but strcat has more obvious meaning than strcon, so that's why it was chosen for a name of the method (I presume).
Note that in some languages, strings are not null-terminated, but rather they start with how many characters the string contains. There's pros and cons to each approach. (Also, the C++ standard library is called the Standard Library. The standard template library used to be a non-standard library that has since been added to the standard.)
im currently doing a course on data structures and we've only just reached pointer variables so this video is linking everything tgr before I've even learned it. cheers
Addendum: Null character terminated strings are the most common way of doing it, but it's also possible to just store the length of the string as a number as the first field, then the string. Then, we know where to stop because we see the length before reading the string.
Not all strings need to end in NULL. Seeing as strings are just arrays, and some languages store the length of an array, a string's length would just use the same value.
True, and both ways have their advantages and disadvantages. Let's say you have a really long string, like loading an entire file (not generally a good idea to load it into a string, use buffers or something instead, but this is an example), then null-terminated strings are smaller, as you'd need more than the size of a character to represent the length of the string if the string stored its length up-front, while the null-terminated string would only add the size of an additional character. Now this isn't a large amount of space, but because scenarios like this exist, the string data type in many languages use large numbers like ints or longs, even if the string is only very short, meaning if you're using hundreds or thousands of strings in a program (for example think about localization files for programs or games) then you're using up a lot more memory this way. On the other extreme though, there are many calculations where you want to know the size of the array, but don't wish to modify or read the array, just know its size, in a null-terminated string the entire array must be iterated down until the null is found to calculate the size (it can possibly be stored afterwards so you only iterate once, but anyways) while storing the size up-front allows you to simply read this value, making these types of operations faster. So both have some advantages and disadvantages and if you're lucky enough to be using a language where you can choose to use either or then choose based on the task, and otherwise other languages that don't have them sometimes have ways for you to implement them yourself if need be.
If you store your strings as immutable structures in memory, the size issues kind of vanish, depending on whether or not length references number of bytes, or number of UTF-8 glyph encodings(Which can be different). Moreover, you can have multiple variants of "String" all implementing the same interface, and encoding length as different width values in the structure. Though, as soon as you get past the length being one byte, it's pretty valid to stop caring about what data type you're encoding length as(Max for a 1 byte value is 1:256). Now, if they ARE mutable, things get fun, and you get into heuristically predicting the possible max size of your string, and giving it a data type wide enough for... however long your string gets. Granted, if your string gets beyond about 9 QUINTILLION characters(on a 64-bit processor, which is the modern standard) you have a very different problem. All told, storing the length of strings has a great many advantages over not doing so, and most modern languages DO do so, because most concerns of space sort of evaporate in the face of modern hardware, and the vast amounts of memory available(Not to mention the fact that 8 bytes to store the lengths of the longest things humans have ever written PALES in comparison to what 8 bytes of length can store)
The main problem with null terminated strings is that you have to be careful of the target size of the character array, this is why you should use strncat rather than strcat. Also it is easier to resize a target string because you can easily determine the size of the strings without traversing the source arrays then allocate the desired memory and do the copy. In fact overall null terminated strings are considered unsafe programming because there is the risk of someone using a buffer overflow to hack you if you don't carefully determine the lengths.
Here in México in my college they teach you about all of this plus the paradigm of object-oriented programming in two courses, called "Object-oriented algorithms and linear storage patterns" and "Object-oriented algorithms and non-linear storage patterns", We just call them by the initials, wich in spanish are APALOO and APANLOO, respectively.
Create complex data structure just really similar as you create a pile of structured files and folders in windowsOS, the pointer similar as shortcut that point to a folder or file in windows, so you can create linked data.
Once upon a time, programmers used the machine language directly to make the computer run quickly. This removed a layer of abstraction which just slowed everything down. ML is like programming with DNA!
A string doesn't necessarily terminate in a null. Although this is typical in C-like languages, many other languages store strings with the length of the string, eliminating the need for null terminating. (and allowing the null character to be included in a string)
Question: can a Linked-List (doubly, circular, single, etc.) be put as children nodes in a BST (binary search tree) and what would be the advantage of that besides packing in a lot of information in a tree-like manner for sorting? If it's possible, what's the general logic to retrieving a particular linked-list node stored in a BST?
I don't see why not, as long as the data in your doubly linked list =/= the data in your BST. i.e. your BST would just be a data structure filled with linked lists. If you're wondering if you can store data from a linked list in a BST, also very possible, but then what would you use the linked list for? The addresses for the data you want should all be in the BST, and easier to get to.
Yeah, it would be possible. the data type of a node on a tree would be a linked list. however, this might not be super practical depending on your application. if you had to do a search, you now have to search a linked list on every given node, which, in worst case, would add linear complexity to search node, changing a BST search from O(n) to O(n²)
that's entirely possible. Sometimes you just have tree data that requires that you store a linked list. Basically, in the tree structure struct BinaryTree { BinaryTree* left BinaryTree* right LinkedListNode value } You could also make LinkedListNode a pointer, which means that all that's being stored by the binary tree is 3 pointers, as opposed to multiple data structures.
The range that includes range that includes range that includes range... and you can jump to another range then jump to another range then jump to another another range... so you can build any structure as you want.
Amazing videos. Thanks. In fairness, the reason why you think these videos explained better than in your college (or you think your college was useless) because you have understood and have existing background already. Imagine if your knowledge is zero.
Wonderful episode and series!! Thank you guys! I wish you showed a more in depth example of the push/pop with link nodes graphically to help. Matrix too lol great job, I'd love 15-30 mins eps just you know you :p ... Always end up watching them 3 times anyway lol
Pointer is a jumping structure, it can let you jump to another one. Just like open a portal and jump, open a portal and jump, open a portal and jump...
Hello, Carrie Anne: Your explanations and videos are great!!! Thank you so much for helping me understand computing better. Small petition (although given my ignorance it may be huge X-D): Could you please say or list the levels of abstraction required to display, for example, a "C" on a computer screen? 20+? Thanks again for being awesome :-) Miguel
Just remember, if you are new, that this 10m video is a 1 semester or a few books study compressed, so take it lightly.
They've explained it better here than at my college... I should be laughing, but it hurts.
lol my school started this like over a month ago and still hasn't finished XD. But its pretty simple tbh
Proof that one on one IS more efficient than telling a group of people to memorize datum.
Am I doing it wrong? I've binge watched up until now, and I plan on continuing until the end. FORTY SEMESTERS WORTH OF COMP SCI IN TWO DAYS!!!
@@aboxinspace Ditto. I am revisiting it 2 years later and I am just amazed how well it explained the concepts in just ten minutes. It helps though having studied it before in my opinion though.
I told my friends that I now know how to access a 5 dimension matrix. They are no longer my friends.
the videos always seem like a compressed version of my first two years of studying computer science. though not as thorough as the lectures back then, these videos really hold up and explain everything extremely well. great job!
Crash course is a great way to refresh your knowledge about almost anything.
0:59
"Almost all programming languages start at index zero"
Me: *slowly turns and glares at Matlab*
MaTLaB Is NoT a ReAl ProGrAmMiNg LanGuAge
Pascal does this as well
*shouts at LUA*
@Thomas Samoht you are right, my bad.
LUA starts at 1 for some reason
Data structures was my favorite subject in my CS courses in college! It all just makes so much sense, and thinking about how each piece of data relates to all the others is like a fun puzzle.
Dear Carrie Anne and crashcourse, I hope you're seeing this.
You are all amazing. Thanks so much for making these very good quality videos and keeping them for free.
I'm considering supporting you after I'm done with binge watching the entire series. I'll definitely recommend this series to others.
I'm impressed. You're amazing.
I'm trying to get my teacher friends to show this series to their students. I love this. All students should see this in class.
I'm learning to Program now, and surprisingly understood everything. Had to stop and scroll back a few times, but that was a beautifully clear explanation of each concept!
For anyone who may just be starting to learn low level languages, be careful when using "NUL" vs "NULL" because they can mean two different things. "NUL" refers to the NUL character or ASCII zero. "NULL" refers to a null pointer - a reference to a non-existent location in memory.
"Null" is its name and NULL was its original abbreviation. So not as wrong as all that. en.wikipedia.org/wiki/ASCII
NULL could also be nullptr. NUL can also be '\0' (char type).
thanks much sir
Thank you
i am so in love with the narrator.She is so adorable !
Always great folks but that was pretty much an entire term's class-worth of data structures in 10 mins. It'd be fascinating to know how many people who encountered this for the first time kept up!
As a side-note it's really good how you refer everything back to memory locations. So often these days people are taught to use data structures as basic language building blocks with no idea what's going on "under the hood".
So, object orientation next week? :-)
Yep, nice but very, very concentrated. As I was listening I too thought that it might be hard to follow or even a bit misleading for a person new to the material. Universal referents and particular implementations got a bit tangled up. Still, an impressive effort given the time constraint.
Interesting. As a C# programmer did you find the discussion of stings at all confusing?
In my college is the opposite, and we had to build a Java class implementing the basic of each and one of the structures that the video showns. For example in an exam I had we needed to implement a funcion in a binary tree in wich we pass an array of numbers in any order and then the numbers got stored in the tree in order.
+Pepys
Thanks, maybe my criticism was misplaced. I suspected that people would watch that and think "oh, that's what a sting ~is~" rather than "that's one good way to implement a string." Your mention of C# jumped out at me since it is an example of a language that does strings differently than presented.
Sorry that I misinterpreted your programming experience.
Many CrashCourse episodes are like crammed with a little too much info to get in one pass. Sociology for example.
I tended to work with languages that were weak in data structures so I had to create my own with strings. Slow, but a great way to learn about data structures. (Hint: the secret is to have a delimiter character for each dimension that is never included in the data content.)
right now I just hope this will be a never-ending course
I am LOVING THIS SERIES! LOVE YOU CARRIE ANNE AND CRASH COURSE!
I love these videos and feel that I am actually finally understanding computers! thank you
dont mean to be rude or discouraging, but this is basically nothing ;(
I'm a computer engineer and I'm doing some Java stuff for like 5 years, and this video gave me the envy to go back doing some C again, like I did back at school.
And I like that.
This series is why I'm getting into arduino programming, and this video just helped me get past a hurdle I encountered on my project. Thanks! =D
this series is like my hit of crack every week that keeps me going
"It'd be weird if roots connected to leaves that connected to roots." *Looks nervously at Bryophyllum daigremontianum* >_>
Found the botanist! Seriously though, that's a dope plant.
I am happy you are here :)
I think most people would be freaked out a lil by how peanuts grow.
You said in the beginning you weren't gonna go into programming yet I feel like I've learned a ton about the fundamentals of code languages and where programming happens. You tricked me into learning way too much!
You basically covered last semester programing course in a 10 min video, I am impressed. But it might be too much information for people who are seeing the topic for the first time.
You didn't play the "A new level of abstraction!" jingle! How could you?!
It's the same abstraction.
I feel cheated. I demand a reupload with proper jingle.
It has been abstracted so it's no longer shown.
I love the jingle and spontaneously combust whenever it comes on.
Anthony Z Soo you catch on fire?!?
Wow. This was super fast! If I didn't already know this stuff, I could easily get lost in all the information!
This is the fastest coverage of basic data structures I have ever seen
one thing left out in this otherwise really good overview is the main disadvantage of linked lists: random access (that is, getting the value at a certain index into the list) becomes much more difficult, and is much less efficient than in simple arrays. each data structure has its tradeoffs and use cases
0:44 list != array
An list uses pointers to get to the next index. An array uses ons block of memory. Meaning that a list is faster if you are iterating over the shops structure, but An array is better of you need to het a specific indexeert element.
As someone studying computer science, this is a fantastic refresher of all the basic concepts. So clearly explained!
I love how the oscilloscope is different each time
i just love this woman, thank you so much
Thank you! Now I understand why I always got errors when Iworked with Arrays. They don't want to grow dynamicly^^
I absolutely loved this crash course at 75% playback speed!
Same. And I usually watch things at 1.5
Exactly what I was just thinking - they're going over this one a lot faster than the previous videos.
Theres no elevator scene after the new level of abstraction!!!! Argh i watch this every week for that!!!!
She is so much more preferable to my monotone prof! I'm learning heaps - THX
A lot of programming languages are very particular about the type of data you give to a function, whereas more flexible ones can accept multiple types. The trade off is inflexibility against precision.
Sam Whelan some programming languages don't let you play with pointers.
A$= "at"+10+"shun"
The main drawback is that miss-typing isn't caught until the system tries to do an operation expecting one type and you give it another.
Static typing generally catches this before any of your code gets run.
Even worse is when the system preforms a different operation because it's a different type. The first time I used python, 10 < 5.
Spent the whole semester for this. Thank you!
God I love crash course :) I only wish you made actual courses on this subject. I am a currently earning my BS in CS and I absolutely love to talk about data structures. Programming is my blood. However, there are so many techniques and different ways to structure your data that I want to know everything I can.
If string concatenation = a strcat
Then does a string array = stingray?
stringray
strcat = string catenation
catenation and concatenation are synonyms but strcat has more obvious meaning than strcon, so that's why it was chosen for a name of the method (I presume).
Stringray, strray, and strarr are three likely candidates.
strarray, but I can see the intention of the joke.
String Array = Fruit of the Loom
Note that in some languages, strings are not null-terminated, but rather they start with how many characters the string contains. There's pros and cons to each approach.
(Also, the C++ standard library is called the Standard Library. The standard template library used to be a non-standard library that has since been added to the standard.)
im currently doing a course on data structures and we've only just reached pointer variables so this video is linking everything tgr before I've even learned it. cheers
Addendum: Null character terminated strings are the most common way of doing it, but it's also possible to just store the length of the string as a number as the first field, then the string. Then, we know where to stop because we see the length before reading the string.
What a great Video!! such clever use of graphics and sounds in education....I enjoyed it wholeheartedly
I'm gonna put watching this video on my resume
Lol
Not all strings need to end in NULL. Seeing as strings are just arrays, and some languages store the length of an array, a string's length would just use the same value.
True, and both ways have their advantages and disadvantages. Let's say you have a really long string, like loading an entire file (not generally a good idea to load it into a string, use buffers or something instead, but this is an example), then null-terminated strings are smaller, as you'd need more than the size of a character to represent the length of the string if the string stored its length up-front, while the null-terminated string would only add the size of an additional character. Now this isn't a large amount of space, but because scenarios like this exist, the string data type in many languages use large numbers like ints or longs, even if the string is only very short, meaning if you're using hundreds or thousands of strings in a program (for example think about localization files for programs or games) then you're using up a lot more memory this way.
On the other extreme though, there are many calculations where you want to know the size of the array, but don't wish to modify or read the array, just know its size, in a null-terminated string the entire array must be iterated down until the null is found to calculate the size (it can possibly be stored afterwards so you only iterate once, but anyways) while storing the size up-front allows you to simply read this value, making these types of operations faster.
So both have some advantages and disadvantages and if you're lucky enough to be using a language where you can choose to use either or then choose based on the task, and otherwise other languages that don't have them sometimes have ways for you to implement them yourself if need be.
There is one more disadvantage of null-terminated strings: you cannot store nulls inside the string, as they are interpreted as termination signs.
If you store your strings as immutable structures in memory, the size issues kind of vanish, depending on whether or not length references number of bytes, or number of UTF-8 glyph encodings(Which can be different). Moreover, you can have multiple variants of "String" all implementing the same interface, and encoding length as different width values in the structure. Though, as soon as you get past the length being one byte, it's pretty valid to stop caring about what data type you're encoding length as(Max for a 1 byte value is 1:256).
Now, if they ARE mutable, things get fun, and you get into heuristically predicting the possible max size of your string, and giving it a data type wide enough for... however long your string gets. Granted, if your string gets beyond about 9 QUINTILLION characters(on a 64-bit processor, which is the modern standard) you have a very different problem.
All told, storing the length of strings has a great many advantages over not doing so, and most modern languages DO do so, because most concerns of space sort of evaporate in the face of modern hardware, and the vast amounts of memory available(Not to mention the fact that 8 bytes to store the lengths of the longest things humans have ever written PALES in comparison to what 8 bytes of length can store)
The main problem with null terminated strings is that you have to be careful of the target size of the character array, this is why you should use strncat rather than strcat. Also it is easier to resize a target string because you can easily determine the size of the strings without traversing the source arrays then allocate the desired memory and do the copy. In fact overall null terminated strings are considered unsafe programming because there is the risk of someone using a buffer overflow to hack you if you don't carefully determine the lengths.
+Piotr Zaborski you typically wouldn't want to stored null characters in a string, it's a special character
You guys are amazing! I have my interviews in the next two weeks and this really helps me speed up
This is why we always say zeroth instead of first.
That algorithm that allows this video to be played at half speed....that's a favorite of mine
Great video good for those who have studied already these concepts in detail
Wow..........this was best for my quick revision of DS. Thanks @CrashCourse!!
I love you Carrie Anne.
hey! you didn't play the new level of abstraction clip!
Is that so bad? It's like 5 seconds long and I kinda just sit there like "yeah, I get it hahahaaa"
Mongols are the exception to being the next level of abstraction.
That's device dependent.
This series is so clearly and helpful.
Good job giving us an easy to understand taste of different data structures
0:22 could've fooled me.
Insanity Cubed who are they kidding? we are all john green.
I can't feel time by hearing your voice
It's just awsome
hopefully you will talk about data hashing, this is crucially important in the modern world of programming.
"Standard Template Library" is the old name. It's the C++ Standard Library now. Glad C++ got a shout-out anyway.
Hell yeah someone else likes c++
how can i like this video more than once
wow an actual video where I knew about evrrything and wasn’t confused at any time during it??
Here in México in my college they teach you about all of this plus the paradigm of object-oriented programming in two courses, called "Object-oriented algorithms and linear storage patterns" and "Object-oriented algorithms and non-linear storage patterns", We just call them by the initials, wich in spanish are APALOO and APANLOO, respectively.
Create complex data structure just really similar as you create a pile of structured files and folders in windowsOS, the pointer similar as shortcut that point to a folder or file in windows, so you can create linked data.
Thanks a lot. I enjoyed the crash course. I now know what data structures are. planning to delve deeper
Yes! Another episode! I've beeeen waiting! 😃
We may have fifo and filo but do we have convfefe?
uvuvwevwevwe
Ben Cradick ?
Crash Course Computer Science! Amazing.
Told my friends I know how to access a 5 dimensionnal matrix. They were impressed!
I have taken so many classes that have gone over linked lists and I never truly understood it until watching this video, thank you so much!!
Alisa Kotliarova you serious??
Boi I sure hope this all makes sense in 3 years when I have to learned this
Earliest programming advice: Once you understand tables (arrays in ML or Assembly) you are 80% there
haha Nope. Atlease not for me. Stupit C++ pointers there the killer.
+kevindt12 would it blow your mind to realise that arrays are essentially pointers?
Explance please do.
.
Once upon a time, programmers used the machine language directly to make the computer run quickly. This removed a layer of abstraction which just slowed everything down. ML is like programming with DNA!
Great video, easily digestible content
A string doesn't necessarily terminate in a null. Although this is typical in C-like languages, many other languages store strings with the length of the string, eliminating the need for null terminating. (and allowing the null character to be included in a string)
thanks for mentioning string cat. Super useful
when this video teaches you more about what a data structure is than your entire semester Data Structures class....-_-
Very basic but still awesome! Thanks
So good! Thank you for the excellent summary
Question: can a Linked-List (doubly, circular, single, etc.) be put as children nodes in a BST (binary search tree) and what would be the advantage of that besides packing in a lot of information in a tree-like manner for sorting?
If it's possible, what's the general logic to retrieving a particular linked-list node stored in a BST?
Um, you mean using a linked-list object being used as nodes of the BST, or the linked-lists themselves are integrated into the tree?
The first one. Nevermind, I don't think that's possible since they're two different data structures.
I don't see why not, as long as the data in your doubly linked list =/= the data in your BST. i.e. your BST would just be a data structure filled with linked lists. If you're wondering if you can store data from a linked list in a BST, also very possible, but then what would you use the linked list for? The addresses for the data you want should all be in the BST, and easier to get to.
Yeah, it would be possible. the data type of a node on a tree would be a linked list. however, this might not be super practical depending on your application. if you had to do a search, you now have to search a linked list on every given node, which, in worst case, would add linear complexity to search node, changing a BST search from O(n) to O(n²)
that's entirely possible. Sometimes you just have tree data that requires that you store a linked list. Basically, in the tree structure
struct BinaryTree {
BinaryTree* left
BinaryTree* right
LinkedListNode value
}
You could also make LinkedListNode a pointer, which means that all that's being stored by the binary tree is 3 pointers, as opposed to multiple data structures.
Graphs are usually stored as list of nodes and tuples of edges.
Another fantastic video. Should help me with my Algorithms exam tomorrow 😊.
I'm glad l managed to pop my cellphone out of my sylladex so l could watch this video.
Science are growing up, benefit opportunity are growing up and the same the extinction opportunity are growing at the same time.
data structures in Java and C++ already there..so no worriers
Also there are trees ,linked list,array,index,struct.
4:14 The "C" programming language uses "struct". A struct is the predecessor of a "class".
Ikem Krueger struct == Class, but with a default public accessor. At least in C++.
carrie anne make things fun to learn :)
The range that includes range that includes range that includes range... and you can jump to another range then jump to another range then jump to another another range... so you can build any structure as you want.
2:36 print[j] should be print(j), if j is an array of characters and print a procedure or function.
The first node, the one at the top, is the root, and the ones at the end are called leaves. They ought to call those pointers "branches!"
2:40-2:50 isn't that basically what heartbleed was about? tricking the computer into giving more information than it was intended to
Carrie Anne, you're a very good teacher!
Amazing videos. Thanks. In fairness, the reason why you think these videos explained better than in your college (or you think your college was useless) because you have understood and have existing background already. Imagine if your knowledge is zero.
love the geeky GoT examples!
I think these videos are sooo interesting. wish their were more
Wonderful episode and series!! Thank you guys! I wish you showed a more in depth example of the push/pop with link nodes graphically to help. Matrix too lol great job, I'd love 15-30 mins eps just you know you :p
... Always end up watching them 3 times anyway lol
Cool video, very well explained!
I like this series!😀😊👍
Wooow , 3 months of computer science in 10 min
Pointer is a jumping structure, it can let you jump to another one. Just like open a portal and jump, open a portal and jump, open a portal and jump...
Hello, Carrie Anne:
Your explanations and videos are great!!! Thank you so much for helping me understand computing better.
Small petition (although given my ignorance it may be huge X-D):
Could you please say or list the levels of abstraction required to display, for example, a "C" on a computer screen? 20+?
Thanks again for being awesome :-)
Miguel
YOU GUYS ARE THE BEST
I'm surprised you did touch on classes and its differences from structures. Good show!
I am fasting and she showed me that delicious meal whyyyyyyy😅
Carrie Anne