ARRAYLIST VS LINKEDLIST
ฝัง
- เผยแพร่เมื่อ 15 มี.ค. 2024
- In this one, we explore how ArrayLists and LinkedLists works at memory level and how scripting languages handle their "arrays."
Sign Up to CodeCrafters:
app.codecrafters.io/join?via=...
Follow me on twitter:
/ coredumpped
Follow me on Github:
github.com/jdvillal
Questions and business contact:
contact.coredumped@gmail.com - วิทยาศาสตร์และเทคโนโลยี
20:34 Fuck I need that card in my wallet
Me too, I hope he sells it as merch one day
best animation quality yet, the pointer hell is somehow very understandable
This is the single best video on the topic ever! When i was studying cs, our prof didn't even try explain how data is stored, he just moved on to using pointers, i had no previous experience with them and was like wtf are pointers. You put it all flawlessly into words AND animations, and a picture is worth a thousand words. Great video that brings so much clarity, every cs undergrad needs to see this. Thanks a lot!
What a spectacular video, I'm just creating my own programming language and this fits me like a glove.
baby wake up core dumped just uploaded
🤣lmao seriously tho
I prefer 'baby wake up core dumped'
yes, I am to watch a livestream of yours solving CodeCrafters challenges
Jon had done the same a week ago with Git, and I watched through the entire thing. that was indeed really interesting, and I'd like to solve these myself too 😊
Nitpick: JavaScript engines typically do implement arrays as continuous blocks of data, and generally setting just one item at index 10k will then allocate up to that number (or more). They just have to pessimise the array for the holes in it.
I remember writing a filter and it was returning null items, you have to be very careful with JS
They use C++ struct arrays, not normal arrays, class arrays or vectors.
Just found your channel! Really happy to see you just uploaded. I love your intuitive visuals to explain all sorts of mechanics
absolutely one of the best channels out there right now. u go even more indepth than some of my college classes and make it seem easy. big ups bro
I remember really struggling with these sorts of topics when I was at university. These are some of the best explanations for OS/low-level programming concepts I've ever come across!
I absolutely adore JavaScript, but concurrently adore these videos. The quality is capital. I aspire to produce quality material like this.
Waited for this video after the previous teaser. Ur videos are the most accurate on the subject there are
Love the quality of the videos I will recommend other people in my class to them because they’re concise and easy to understand. Keep it up!
Incredible work with these videos so far. Hitting all the key points at just the right level of detail. The animation work is just... * chef's kiss * Keep it up 🙌
I learn so much deim your videos!! Thanks a lot !!! I'm waiting for the next one!
I wasn't able to leave a comment on your post from yesterday but I guessed arrays and I was right! I love these deep dives
George, your videos are really awesome! I already knew all these concepts but I have never seen them better explained. Anyway, I love C and Assembler because they are teaching how computers work...😊
you've mentioned about thinking to solve codecrafters challenges on stream.
Yes please!
Thank you so much for this video, excellent explaination! I have a question, though: as you showed, in languages like Rust, besides specifying the array's size, it's also necessary to specify the data type (integer, float, etc...), and from what I understood, it's because this way the compiler already knows how many bytes to read for each element. However, at 19:45, in the case of Python, how does the interpreter know if, once a pointer is dereferenced, the retrieved object is an integer, a string, or another element with indefinite length? Because according to your (beautiful) animation it seems like every object has it's own specific size.
Interpreters attach 'tags' to values in memory, so when the value is needed, it first reads the tag to identify the type of the value and know how many bytes to read.
The answer is explained in my video: The size of your variables matters.
One of the best videos I ever watched in my life
Amazing as always
Would love to watch those streams
About 17:45, I'm no great expert on system programming, but the severity of data locality is unlikely severe. The cost of pointer-based array instead of a template array resides in the unpredictable position of object allocation, which confuse the CPU cache prefetcher. In reality, most workload allocates objects (as each object in the containing array) closely or in a predictable fashion, so prefetching works adequately well. And of course, pointers are still grouped together as always.
For example, if we add items to a list in a loop, it is trivial for the CPU prefetcher to assume the next approriate location. Hotspot specifically, each thread has its own thread heap, so as long as the array/list is not multithreaded (which is unlikely), the pattern will be maintained. Moreover, with the nature of GC, the compacting phase will very likely move spreaded objects all over the heap to a single location, both avoiding fragmentation and maintaining the fetch pattern.
There are exceptions, like if a BaseType array could contain both DerivativeType1 and DerivativeType2 with completely different object layout (only possible with reference-based array), then it's difficult for the CPU to make a good sense of the fetch pattern, which will likely suffer from "data locality". But as always, the template array would also suffer from this, so it's rather an unfortunate universal technical difficulty.
I did try to use the *void pointer once! It was hilarious when you mentioned it
I've been working with Java for almost 20 years, and I don't think I've ever thought about what happens when you remove an element from an ArrayList.
Thanks for the eye opener.
Me too, but with Go. Now I understand the motivation for slices vs arrays
I recommend everyone starting to understand the data structure to subscribe this channel and save this video, well done very nicely demonstrated!
I have yet to see the combination of a linked list and array list in the wild that I was taught in my AlgoDat course and never again afterwards. It stored the data in a big array that can be relocated to grow, but also a separate mapping from indexes to array offsets. That sounds like a linked list (just with array indexes instead of full pointers) that enforces some form of memory coherence for both list nodes and data. As far as I know, you can refine this concept to a linked list of array slices, which is how text editors support efficient cutting and pasting of text.
Javascript bashing ✅
Engaging and interesting systems programming content ✅
Funny retorts for armchair programmers ✅
Im so glad i found this channel early and subbed
What a fantastic video! Now all I want is to program in Assembly to learn how really an computer works, and to optimize all those inefficiencies those languages introduce!
Great presentation 👌
Hi, the video has been pretty interesting so far. Just a suggestion: please put the link to the previous videos you recommended. Otherwise, in a year or so, it will be much harder to find. Unfortunately, TH-cam showed exactly where the current video is in the channel's timeline.
Very good video, this is the kind of teaching that works for me so thank you
this content is pure gold!
It should be pointed out that the cache behavior of linked lists is NOT inherit to the linked list structure but rather to the allocator used to allocate the nodes. If we have an allocator allocators linearly the nodes will be located in memory in exact the same way as with the array. Alternative approach is to store enough elements in each node so that a full cache line is always used. Removal and addition from the middle of a node can be solved with splitting and merging.
Also I am certain that pretty much all javascript interpreters really do use arrays whenever possible and only resolve to hash map as a fallback when the wasted size is too much or keys are some other type than numbers. This is not too difficult to implement internally and the performance boost is significant.
This is very important to note. I also think iv read v8 uses property access for very small and likely to not be modified arrays. This way it can do direct property access without hashmap lookup or array indexing.
The content is great.
Would be interesting to see your overviews about how rust's compiler works and about compilers theory in general. As well as interpreters actually.
The quality of this channel is amazing, I wish you all the success and I'm excited to see many more interesting and educative videos like yours, you have a good way of getting your point across... I'm a
More reasons to hate JS :D
(And yes to the streams)
Also if you intend to expand your community on other platforms a discord server might be a good idea too.
Great videos, thank you for your efforts!
You are back🎉
Yes , really good
Heeeesss baackkk
This channel is about to blow up🎉
that's why i propose all scripting languages should be pseudo compiled: the bytecodes are as specific as assembly instruction (not as much but you get it), and the generic stuff actually happens at "compile" time, every scripting languages should do that, even at the cost of longer "compile" time. I want to do one, but I struggle everytime when making the parser so you will probably never see that.
Also in java, if it's not a primitive, it's an object, every arrays of non-primitives in java are arrays of objects, and you can verify it with the JNI.
Thanks for the knowledge!
Wow, so informative, thanks so much. I’d watch a live coding session.
12:03 did you cousin also write a getter for "self.lenght" (of self.items[self lenght]) to be the same value as "self.length" ?
You are very good please continue like that and I will be happy if you touch on the assembly perspective of the things too 😄
Maybe it would be better to say that modern JS JIT compilers, like V8, often optimize arrays?
i love that little departure to interpreted language land
Omg I loved this video. Super cool to know how python’s list works under the hood. Can’t wait for what you’ve got next!
i recommended the first 3 videos in this series to some computer science students i was tutoring because i felt like they went in depth into these concepts, while at the same time using terms and concepts that beginner programmers are familiar with. i felt like this video used a lot more terms and concepts which might be difficult for beginner programmers to understand compared to the last three. i think this series would be better for introductory students if the smaller concepts mentioned in this video like data structures, time complexity, etc. had heir own video before having a video about dynamically sized collections
in other words i felt like the pacing in this series took a sharp turn that might be too overwhelming for me to be able to recommend it to other computer science students. judging by the pacing of the first three videos in this series, it seemed like these videos were attempting to cater toward beginner-intermediate programmers with around a year of experience, but this video didn’t come across that way, although i may be wrong in my assumption for the targeted audience of these videos
@@sa-hq8jk I think there is enough context to understand what a datatype is without giving the textbook definition of what a datatype is (which i doubt will be helpfull to anyone anyway). A definition of time complexity would probaply have been nice, it is easy to understand and aply in these cases and can also easily be googled if needed.
@@someonespotatohmm9513 i didnt mean what exactly a data type is, but more of how a struct is a type which combines other types, and how they are grouped together in memory and interpreted by the compiler and by memory
Amazing video. And thank you for not pedaling surfshark or some unrelated crap. Video bookmarks would be welcome!
This is incredible
Excellent!
no need to be so self-conscious at the end there. this channel is great
You are doing revolutionary work bro
Keep going ,keep posting more often
Amazing video!
What a gem of a channel. Keep it up!
Thanks. I had always assumed ArrayList was just some sort of alias for a Deque, but now I know, it's just a dynamic array type. Java is one of those languages that I've avoided fully learning and any language that reuses that name for a container type too. As it is now, I probably have far too much knowledge of Java.
your content is 👑. my kids will study from this channel one day 🥹 and their kids 😇 and their kids kids for generations learning low level concepts and rust. 🥂
I would have never suspected that an IT person can actually explain something well enough for people to understand. Good job buddy
The reason why most programmers are bad at explaining things, is that they don't fully understand most of the things they would try to explain. And the reason for that, is that most of the time they were given a surface level explanation themselves, and they just accepted it.
@@tonchozhelev EXACTLY
Programmers and IT people aren’t the same
@@vimandmanyothers554 it shouldn't be the same, i agree, but sadly the line is very blurry these days. a lot of programmers nowadays have no real clue what their code is actually doing, all they care about is whether it works or not. this stems from the overly-corporate nature of the modern internet and digital world. as long as it gets them money on the short term, who cares if it's performant, well-written, robust code? the mindless consumers certainly don't, so why should the multimillion dollar companies care? sad world we live in
@@tonchozhelev I have en education in embedded systems and having watched all the few videos they've done so far I've already learned several important things that no-one bothered to explain about how different data-structures are implemented by the compiler and why/how that has significant performance implications.
Really great video, although I would have liked it if you talked about bounds checking in a normal array when you were talking about indexing out of bounds
Good content, thx!
Please do Hashmaps next and how are its elements linked and how does it look like in memory
Linked lists are for tape storage. Similar structures are used for block or heap storage.
“This explains why we use zero instead of one for the first element”
What a hero 🙌. Finally a non-stupid “programmers just count from zero” explanation
amazing video!
This was indeed a banger
Thankyou so much for these videos plz keep making them they are so good
Excellent videos. Love your channel!
Very well explained, these kinds of animations are extremely useful.
love your videos
I think when he says ‘and so Forth’ he’s actually telling us what programming language to use.
😂
We are 2 orange S
Yet another banger from project CD!
The Lua Table has entered the arena.
It would be interesting to see what Lua’s cache hit & miss rate is compared with other languages…
another great video
God please never stop making vids my guy AGHHHHHHHHHHH
i wish i had the opportunity to access all these kind of videos when i was studing computer science!
Me too!
@14:59, is it not possible in this case to move the first element to the right and then update the base memory address to its moved location?
which tools are you using to create these animations. looks pretty good
Man this animations
Where were they for all these years?
The early bird gets the typo
Fixed, thanks :D
@CoreDumpped
Thank you for all the effort you put into crafting explanations + animations even a newbie like me can grasp so easily 🙏
I've been wondering for some time now, what do you use to animate your videos?
absolute mad lad
Thanks
excellent
Be aware that modern javascript engines optimises arrays if they have no holes (java like) and even more if they are of the same type (c like) : check for SMI, DOUBLE_SMI, HOLEY_SMI, etc js arrays.
So modern js engines are no more just an interpreter but also a list of runtime JIT compilers run depending of the context of the running code (the more a bit of code is run the more it uses the most complex JIT compiler with the most optimisation).
hence why js nowadays can be as fast as some compiled languages.
Your cousin may know more than me, but he still misspelled "length" in that code :P 11:50
Could someone kindly explain to me in depth and on a low-level 3:20? If ultimately all objects stored in memory (strings, ints, etc.) are just a sequence of bits at the end, how does the CPU differentiate (interpret) the binary sequence for the integer 65 and the binary sequence for the character "A"? Is there some "tag" that is associated with every variable that routes the variable to the correct processing unit within the CPU?
inherently all data that we use are indeed just a sequence of bits and bytes. the reason we have types in compiled systems languages is so that the compiler can use it to determine type information of something: the compiler can deduce the stack size, utilize packing for structs, ownership, etc. also reasoning about your code/instructions, from both the compiler and the programmer's perspective. you can think of types as a way to express something about the value associated to a name/symbol, i.e. "john" variable can contain a "Person" struct. you can also think of types as a property arising from restrictions/expectations of a data blob, i.e. think about a 7-bit character type that's actually allocated on a single byte.
ultimately, there's nothing inherently low-level preventing from eliminating all types and treating everything as a generic sequence of bytes. but that is counterintuitive for the compiler and the programmer.
edit: i implied this but to clarify, the processor doesn't know the type of a piece of data (well not exactly, but this is a good approximation for programmers). even instructions and pointers are data from the perspective of the processor.
also in interpreted languages, yes there are indeed tags attached to objects to keep track of the data they hold. i'm not aware if there's interpreted languages that doesn't use tags
what do you think about Fast LinkedList with algorithmic time complexity?
There‘s no way i was too lazy to comment „Dynamically sized data structures“ on yesterday’s post 😂 I had it 😭😭
Please do streams would be so nice
In Lua arrays are done the same way as in JS: they are in fact maps with values being indexed by numeric indices
I created a linked list in C with two levels of indirection with varying orders of magnitude up to a billion elements. However, I never got valgrind to report cache misses above 0.7% when pushing all, then accesseing all then popping all. I understand that valgrind will report a simulation of the cache rather than the actual cache, but it was the best I could do to measure because my kernel does not have perf.
If only I had you as my professor
Nice.
Thanks for your hard work!!!🎉
Couldnt you use a map to access elements in a linked list, and making the lookup time constant with that?
afaik js arrays are actual arrays and not hashmaps... you can do array.string_key = value because like everything else js array is ALSO an object, but it contains an array as well, you are just assigning a property to the array object. If you do array[12]=some_val to a new array you will see the length actually change but if you do array.string_key=val length does not change... so basically it is {[,,,,,,,,,,,some_val], string_key: val}, js engines optimize it anyways
What software did you use to create these screens and animations?
Despite its quirks I love JavaScript for many reasons, one of which is that we want better performance in arrays, we can use typed arrays.
The hash map approach is quite clever IMO, since in most JS code you won't be looping more than a few hundred (or few thousand at the most) times in a normal array, and if you see doing more than that, then well, you should probably reconsider your approach.
All about being the right tool for the job. And if JS is just too slow, you've got WASM. And if WASM is too slow.......... then ditch JS/WASM and build a native app. 🤣
Yes I agree, the right tool for the right job. What I really dislike is that people trying to convince the world that JS should be used everywhere.
pointer arithmetic was baked directly into intel 8086 cpu instruction set, no wonder systems programming langugaes at the time would also reflect the feature in their syntax
Does this has anything to do with that take that I've been recently reading a lot claiming that C beats everything because CPUs are designed to be 'C-compiled code' efficient?
May I give two thumbs up ?
Yes I want a stream!!!