I've been working with Java for nearly 15 years now. I remember studying linked list in and various other data structures in college. John, you explained something that college professors flunked folks over so much better and in a matter of minutes rather than days. Bravo sir.
I´m currently struggling through my data structures course and i couldn´t agree more. My professor has spent the last 4 classess explaining this topic to us and i honestly couldn´t get it because my adhd doesn´t let me pay attention for more than a minute after I get ever so slightly lost; but all i needed was John´s explanation about how both are dynamic arrays that only differ in the way tey access the nodes.
@@jorgeburgos6502well, normally ik a data structures class you would learn to implement it by yourself, not just import it from the utils package, but you got most of the idea through so keep it up
Your channel is the only one that has increased my enthusiasm for Java, tenfold. Your videos really are a breath of fresh air here on RUclips. I’m going to watch all your vids and thumb-them-up in gratitude. 👍
I was about to post this: "Many tutorials here on RUclips, and on Udemy, etc. But this is the very first time I feel utterly comfortable with one of them, because you go straight to the point in a very clear way, avoiding extra explanations. Thanks for your time/work!". But @findlestick already put a good one, so mine replying his. Thanks again John, you definitely rule this thing. ❤
This is *by far* the easiest video to help understand this concept. As a relatively new programmer, I always found it somewhat puzzling to have different implementations of the List interface, but this video clears so many things up and gives actual reasons for their existence! Cheers!
The arrayList does not leave a "space" for the new element in the new array. It instead duplicates all the values from the index into which you want to move the new element into . Those duplicates are positioned one index down from that point (you get one doubled item ) and then that doubled item is replaced with the new one you are moving so the process it's actually longer than what you explained :)
I once had a job to improve performance of a java application. Best improvement was done by just exchange a LinkedList to an ArrayList, because it was used to read a lot by index. Very simple change, but massive impact.
It’s so refreshing to hear an explanation that doesn’t have a heavy accent. Almost all my professors are hard to understand and it makes it difficult to learn
Amazingly clear video, great job. Just a minor remark: To emphasize that the interface of the two lists is the same you could have used just List as their type. Generally, that is the recommended way anyway.
As someone who hasn't touched java except when an interview required it - watching your videos made me feel like I can code anything in java now. You're an excellent teach, bro. You've got a gift for sure.
Crazy how someone can explain all this clearly and simply in 10 minutes. Where my uni would take 2 mins of explaining nothing with a minimalistic slide showing what a linked list looks like. Thank you so much
In most use cases, amortized analysis shows equivalence of run time. Linked lists, however, lead to more cache misses (array can be bulk copied to cache with much fewer misses) which puts array in a huge advantage for practical reasons as well.
Wish i had someone to teach me these stuff earlier…I had to learn these things the hard way. Awesome video man!! Just one thing I think array list uses a load factor of (0.75) to decide when to scale up not when the list is totally full(e.g. like reached 10)
If someone is wondering why arrays have a constant time to get an element, it's because to get an element from the array, it makes a calculation, a really simple calculation actually.. the programs already knows the position that the array is located in the memory, and already knows the type of data the array is holding, so it can calculate the location of any index with a constant number of steps by doing : memoryPosition + (index * typeSize). So, knowing the “start” position of the array, you just need to multiply the index by the amount of memory that this specific type takes. Let’s say you have an array that holds 100 int numbers, and let’s say the array is located at the space 1000 of the memory.. and int numbers take 4 bytes of memory each. So, to get the 50th element, we just need to multiply the index by the size of bytes (49 * 4) and we will get 196 bytes, now, just add the 1000 (the position that the array starts in the memory), you will get 1196 bytes, this is where the index number 49 is located. That's why it's constant, because you can have a 3 size array or a 100000 size array, the array will always do the same math calculation to get the index that you want to get.
ArrayList is still great if you are adding tons of stuff only to the end. It only needs to move stuff over when adding *not* at the end, otherwise it just places the element at the end and updates the current size. Additionally, it only needs to create a new array and copy everything over when the reserved capacity is exhausted. If you are keeping a reference to some node deep in the midst of the LinkedList, and adding or removing around *that*, then the LinkedList is faster. Also, if for some reason you are often adding and removing right at the beginning, a LinkedList comes into its own. Lastly, there is more memory overhead and less cache coherence with LinkedList. A funny quote I remember: “Does anyone actually use LinkedList? I wrote it, and I never use it.” Joshua Bloch Searching that gives some interesting information on it. As you said tho, for small data sizes, either of them would work great, you will likely never notice a difference unless your data gets larger.
I use LinkedLists a lot for exactly the memory reason. Namely no memory fragmentation. Where an ArrayList occupies new bigger and bigger chunks as it grows, it leaves the old memory segments behind that are too small for the new List to fit into. Thus memory will easily look like swiss cheese with lots of unuseable free memory inbetween. The LinkedLust however can place its nodes into "any tiny spot" and thus saturate memory more dynamically. So while a LL sure performs worse as a main read-object, the write-benefits outweigh for temporary and dynamic data in my opinion.
@@DanielNit what you describe can be true in some circumstances, I believe it is less relevant in garbage collected systems with a mature and evolved collector. That is, the jvm has freedom to do a lot of heap cleanup behind the scenes. It was relevant in c and c++ for me however. If you are often adding or removing far from the ends the linked list is great. Arraydeque comes into its own when all or most of the adds and removes are at or near either or both ends. For small data, none of this makes much difference. For larger data profiling one's heap interactions can answer the question for the actual combination of data, code and jvm/gc implementation.
Sure in managed languages like Java, it likely wont have that much of an impact, but as most things, it is situational. Henve why I specifically refered to dynamic and temporary use cases and it all surely only matters at bigger sizes. So tens of thousands, millions and more, as well as services/servers that continously run for a long time. That said, I didnt doubt your expertise or anything but it is merely my quirk with fragmentations from many languages with absolutely no solutions against these issues but similar data structures as described in this video. Also happy new yeah ^_^
@@DanielNit you too. Fragmentation is a huge issue in non-managed systems if ignored. Large commercial systems I worked on addressed it on at least two levels and it was still something to consider even then. I have spent less time so far monitoring pure Java systems, and gc is one area that may change and evolve more as it doesn't affect the api's. Happy new year!
@@DanielNit if there is place behind the current array, it should expend in that, and don't take a new place. Else the question is, if the overhead of the linked list is worth it, to not take a chunk of memory. (Together with the get time complexity)
Wow. What an easy-to-understand yet well-informed video. This is much better than my professor's two-hour lecture on this subject. This is exactly what I want to watch for learning anything!
I was asked that question during a interview. My answer was exacly what you said in the video. But I failed when I had to compare both list when inserting in the middle of them. I said that a LinkedLIst is always the best choice in terms of adding/removing...and my application had been refused because that. So to my understanding: LinkedList: 1) To find a middle Node is O(n/2) 2. Insert is 0(1) O(n/2) + O(1) = O(n/2) ArrayList: 1) Get a middle position and insert O(1) 2) Shift the second half of array is O(n/2) O(1) + O(n/2) = O(n/2) So, if I was asked which list is batter for inserting in the middle I would say, that in both cases we have O(n/2) Adding a new element at the end of list. In both cases is O(1). Adding a new element at the first position. LinkedList is 0(1), ArrayList must be shifted all elements, is O(n) Tell me if I am wrong? Thank you
John. I'm computer engineer student, and your videos are just brilliant. Thank you so much for so, so good content. Keep it up! I will support this channel the best way I can :-)
00:00 Creating and comparing linked lists and array lists in Java 01:31 ArrayList and LinkedList are virtually identical 03:02 ArrayList vs LinkedList in Java 04:38 Linked lists are a chain of nodes with pointers to the next node. 06:09 ArrayList and LinkedList have different ways of storing data. 07:36 Linked lists are better than ArrayLists for adding or removing elements. 09:00 Linked lists are faster for adding and removing elements, while arrays are faster for getting elements at a certain position. 10:25 Choose ArrayList for retrieving specific values, LinkedList for adding/removing elements.
This is the most amazing course ever! Exactly what I want to know regarding of why use one from the other. Best examples and I got it rightaway. This guy is genius and should be a professor instead.
Hi John. Thank you for your wonderful clarification. This is by far the most clear tutorial I have ever watched to understand the difference LinkedList vs ArrayList and you explained it in a perfect way so that I could easily understand it without even re-watch the video.
Hey John. I was cording for past 10 years. Never ever thought about it. You are an eye opener. Wonderful explanation. Thank youuuuuu veryyyyyyy muchhhhh😄😄😄😄😄👍👍👍👍👍
I'm glad youtube suggested me your channel John. Your videos are truly inspiring, and quite useful for a beginner like me. I want to declare my appreciation for the work you're doing here =) Thank you!
Thank you so much for explanation, i am us array list most of time. But i had read it multiple time but didn't understood it well. But in your end of the video when you gave example that made me understood. Now i know which to use when
This channel is tight. I was at a plateau until you happened to pop up in my feed. It's funny because I was scratching my head trying to figure out how to make my program with just arrays. It couldn't work because I needed something with an adjustable size, so I ended up finding your Array List video, and now I'm learning that Java has linked lists, which will be awesome for the spaghetti program I am making.
Dude, I love your channel, I hated Java a time ago but I've been working with php (some POO) and I've been opening my mind to Java too, I had to do a Project using Java to my College last month, and you helped me so much with your videos. Now I'm watching every video just because I started to Love it. Thanks Bro! Ps: I'm from Brasil, and my english isn't that good.
Thanks for the awesome video. I had bought some Java course on Udemy and I keep coming to your videos as you explain them in a much better way than those in Udemy.
Thanks John, good starting point for Java Coders in the intermediate stages looking to go advanced and being Java is applicable with mobile apps. Have posted on my twitter, Regards and keep these videos going. Mark
ArrayList: if your logic GET value frequently LinkedList: if your logic INSERTS/ADDS, DELETE value frequently Thanks for video! Im learning a lot. My goal for #2022 is Spring Certification and Java Certification.
thank you so much for this tutorial. now I know what is really the difference between them. I hope you’ll grow your channel more. Please make a tutorial for Data Structures in Java as well. That would be really helpful
The traversal of a linked-list is slower than shifting all the elements of an array list by one. So, with larger amounts of data modifying a linked-list becomes exponentially slower and produces many cache misses.
I'm glad there is that pinned comment. The video is technically (videographically) fine, but the content is really questionable. I'd also type the variables as List, it is universally good practice, unless you want to use specific methods (e.g. queue operations). And then there is that LinkedList theoretical usefulness: 1) One big trouble is that having an element and getting the internal list node are two different things. So in theory, remove is O(1) if you have the node. But you don't, so in practice it's O(N). 2) While going linearly through a list and then quickly removing a single element MIGHT be still faster than shifting stuff in an array, it hardly ever is because of memory co-location of array list elements (and lack thereof in linked list). Many array list operations are covered by the fastest caches in CPU, while the linked list jumps often all over the place evicting cache rows in the process. Long story short, array list virtually for all cases. Linked list perhaps for some queue/stack tasks, unless you use something even better suited from other libraries. And measure before bold claims.
Thank you so much for sharing these courses with us. I have a question, when we add many objects to an ArrayList we know that it creates a larger internal list each time it runs out of space so, What happens to the previous internal lists that The ArrayList created before the latest one? Ones again Thank you very much john, hope you can share your LinkedIn Account with Us : ) !
What editor style do you use to have such bright colors for the code? Makes it very readable for this video. As always solid lesson and I left this comment for the algorithm!
This is Eclipse with a dark theme plugin called Darkest Dark. I think I have the color scheme changed to IntelliJ dark theme defaults, ironically enough. In more recent videos I've switched to IntelliJ and use the default colors, just tweaked to make the background darker and the colors pop a bit more in the videos.
Great video! I've actually never used either of these collections, as my java teacher had a preference for Vector and it stuck with me. So that leads me to a question: how do Vector and other collection classes play into the discussion and when would you use them over ArrayList?
Be sure to check out the pinned comment - ArrayList tends to be faster for literally everything 99% of the time due to modern architecture, even though theoretically it might seem that LinkedList should be faster for some operations.
I've been working with Java for nearly 15 years now. I remember studying linked list in and various other data structures in college. John, you explained something that college professors flunked folks over so much better and in a matter of minutes rather than days. Bravo sir.
I´m currently struggling through my data structures course and i couldn´t agree more. My professor has spent the last 4 classess explaining this topic to us and i honestly couldn´t get it because my adhd doesn´t let me pay attention for more than a minute after I get ever so slightly lost; but all i needed was John´s explanation about how both are dynamic arrays that only differ in the way tey access the nodes.
@@jorgeburgos6502well, normally ik a data structures class you would learn to implement it by yourself, not just import it from the utils package, but you got most of the idea through so keep it up
Your channel is the only one that has increased my enthusiasm for Java, tenfold. Your videos really are a breath of fresh air here on RUclips. I’m going to watch all your vids and thumb-them-up in gratitude. 👍
Awesome, I'm really glad I could inspire that kind of interest!
I love your videos!
@@CodingWithJohn Could you do a Hashset video by chance.
Great idea! I'm actually planning that for my very next video.
I was about to post this: "Many tutorials here on RUclips, and on Udemy, etc. But this is the very first time I feel utterly comfortable with one of them, because you go straight to the point in a very clear way, avoiding extra explanations. Thanks for your time/work!". But @findlestick already put a good one, so mine replying his. Thanks again John, you definitely rule this thing. ❤
I don't know how your videos can be so condensed but still thorough. Thanks from all of the Computer Science majors.
It was like those lectures where the instructor teaches so smoothly so s/he puts everything in your mind without you noticing.
This is *by far* the easiest video to help understand this concept. As a relatively new programmer, I always found it somewhat puzzling to have different implementations of the List interface, but this video clears so many things up and gives actual reasons for their existence! Cheers!
The arrayList does not leave a "space" for the new element in the new array. It instead duplicates all the values from the index into which you want to move the new element into . Those duplicates are positioned one index down from that point (you get one doubled item ) and then that doubled item is replaced with the new one you are moving so the process it's actually longer than what you explained :)
July 14, 2022 - Properly learned ArrayList and LinkedList. Thanks John!
I once had a job to improve performance of a java application. Best improvement was done by just exchange a LinkedList to an ArrayList, because it was used to read a lot by index. Very simple change, but massive impact.
I have problems understanding LinkedList despite reading numerous articles online. Your video is a god's gift!
It’s so refreshing to hear an explanation that doesn’t have a heavy accent. Almost all my professors are hard to understand and it makes it difficult to learn
Ngl I would die without this channel
Amazingly clear video, great job. Just a minor remark: To emphasize that the interface of the two lists is the same you could have used just List as their type. Generally, that is the recommended way anyway.
As someone who hasn't touched java except when an interview required it - watching your videos made me feel like I can code anything in java now. You're an excellent teach, bro. You've got a gift for sure.
Crazy how someone can explain all this clearly and simply in 10 minutes. Where my uni would take 2 mins of explaining nothing with a minimalistic slide showing what a linked list looks like. Thank you so much
Great vid... the more I learn about Java the more these tutorials come through in the clutch.
How can a man be so precise with his teaching! Great job.
I learn java since 2014 but now I understand it. Huge thanks
In most use cases, amortized analysis shows equivalence of run time.
Linked lists, however, lead to more cache misses (array can be bulk copied to cache with much fewer misses) which puts array in a huge advantage for practical reasons as well.
Wish i had someone to teach me these stuff earlier…I had to learn these things the hard way. Awesome video man!!
Just one thing I think array list uses a load factor of (0.75) to decide when to scale up not when the list is totally full(e.g. like reached 10)
Thanks John, you are the most clear java youtuber.
If someone is wondering why arrays have a constant time to get an element, it's because to get an element from the array, it makes a calculation, a really simple calculation actually.. the programs already knows the position that the array is located in the memory, and already knows the type of data the array is holding, so it can calculate the location of any index with a constant number of steps by doing : memoryPosition + (index * typeSize).
So, knowing the “start” position of the array, you just need to multiply the index by the amount of memory that this specific type takes. Let’s say you have an array that holds 100 int numbers, and let’s say the array is located at the space 1000 of the memory.. and int numbers take 4 bytes of memory each. So, to get the 50th element, we just need to multiply the index by the size of bytes (49 * 4) and we will get 196 bytes, now, just add the 1000 (the position that the array starts in the memory), you will get 1196 bytes, this is where the index number 49 is located. That's why it's constant, because you can have a 3 size array or a 100000 size array, the array will always do the same math calculation to get the index that you want to get.
Hey John i am from morroco nord of Africa i am beginer in Java i just want to Say you are doing a great work your vidéos helps a lot .
I just found your channel, this is the second video I'm watching and it has already become my new favorite channel. Good work, keep it up :)
ArrayList is still great if you are adding tons of stuff only to the end. It only needs to move stuff over when adding *not* at the end, otherwise it just places the element at the end and updates the current size. Additionally, it only needs to create a new array and copy everything over when the reserved capacity is exhausted. If you are keeping a reference to some node deep in the midst of the LinkedList, and adding or removing around *that*, then the LinkedList is faster. Also, if for some reason you are often adding and removing right at the beginning, a LinkedList comes into its own. Lastly, there is more memory overhead and less cache coherence with LinkedList. A funny quote I remember:
“Does anyone actually use LinkedList? I wrote it, and I never use it.” Joshua Bloch
Searching that gives some interesting information on it. As you said tho, for small data sizes, either of them would work great, you will likely never notice a difference unless your data gets larger.
I use LinkedLists a lot for exactly the memory reason. Namely no memory fragmentation.
Where an ArrayList occupies new bigger and bigger chunks as it grows, it leaves the old memory segments behind that are too small for the new List to fit into. Thus memory will easily look like swiss cheese with lots of unuseable free memory inbetween.
The LinkedLust however can place its nodes into "any tiny spot" and thus saturate memory more dynamically.
So while a LL sure performs worse as a main read-object, the write-benefits outweigh for temporary and dynamic data in my opinion.
@@DanielNit what you describe can be true in some circumstances, I believe it is less relevant in garbage collected systems with a mature and evolved collector. That is, the jvm has freedom to do a lot of heap cleanup behind the scenes. It was relevant in c and c++ for me however.
If you are often adding or removing far from the ends the linked list is great. Arraydeque comes into its own when all or most of the adds and removes are at or near either or both ends.
For small data, none of this makes much difference. For larger data profiling one's heap interactions can answer the question for the actual combination of data, code and jvm/gc implementation.
Sure in managed languages like Java, it likely wont have that much of an impact, but as most things, it is situational.
Henve why I specifically refered to dynamic and temporary use cases and it all surely only matters at bigger sizes. So tens of thousands, millions and more, as well as services/servers that continously run for a long time.
That said, I didnt doubt your expertise or anything but it is merely my quirk with fragmentations from many languages with absolutely no solutions against these issues but similar data structures as described in this video.
Also happy new yeah ^_^
@@DanielNit you too. Fragmentation is a huge issue in non-managed systems if ignored. Large commercial systems I worked on addressed it on at least two levels and it was still something to consider even then.
I have spent less time so far monitoring pure Java systems, and gc is one area that may change and evolve more as it doesn't affect the api's.
Happy new year!
@@DanielNit if there is place behind the current array, it should expend in that, and don't take a new place. Else the question is, if the overhead of the linked list is worth it, to not take a chunk of memory. (Together with the get time complexity)
Wow. What an easy-to-understand yet well-informed video. This is much better than my professor's two-hour lecture on this subject. This is exactly what I want to watch for learning anything!
These are the best Java tutorials that I've found on RUclips and believe me I've looked. Thanks a lot really!!
Im new to Java and started self-studying. This is so easy to understand thank you
I was asked that question during a interview. My answer was exacly what you said in the video.
But I failed when I had to compare both list when inserting in the middle of them. I said that a LinkedLIst is always the best choice in terms of adding/removing...and my application had been refused because that.
So to my understanding:
LinkedList:
1) To find a middle Node is O(n/2)
2. Insert is 0(1)
O(n/2) + O(1) = O(n/2)
ArrayList:
1) Get a middle position and insert O(1)
2) Shift the second half of array is O(n/2)
O(1) + O(n/2) = O(n/2)
So, if I was asked which list is batter for inserting in the middle I would say, that in both cases we have O(n/2)
Adding a new element at the end of list. In both cases is O(1).
Adding a new element at the first position. LinkedList is 0(1), ArrayList must be shifted all elements, is O(n)
Tell me if I am wrong? Thank you
Just want to show appreciation for these videos. You're saving me from drowning in my programming & methodologies II course!!
John. I'm computer engineer student, and your videos are just brilliant. Thank you so much for so, so good content. Keep it up! I will support this channel the best way I can :-)
00:00 Creating and comparing linked lists and array lists in Java
01:31 ArrayList and LinkedList are virtually identical
03:02 ArrayList vs LinkedList in Java
04:38 Linked lists are a chain of nodes with pointers to the next node.
06:09 ArrayList and LinkedList have different ways of storing data.
07:36 Linked lists are better than ArrayLists for adding or removing elements.
09:00 Linked lists are faster for adding and removing elements, while arrays are faster for getting elements at a certain position.
10:25 Choose ArrayList for retrieving specific values, LinkedList for adding/removing elements.
Thank you so much for all these videos! I've been watching them this semester and they have helped tremendously
this is the only video that really makes me understand what an arraylist and linkedlist is, thank you!
This is the most amazing course ever! Exactly what I want to know regarding of why use one from the other. Best examples and I got it rightaway. This guy is genius and should be a professor instead.
Hi John. Thank you for your wonderful clarification. This is by far the most clear tutorial I have ever watched to understand the difference LinkedList vs ArrayList and you explained it in a perfect way so that I could easily understand it without even re-watch the video.
Thank you for your videos. Trying to learn Java on the job and your tutorials are quite literally saving me at every turn.
Conclusion, AL is better for storing, retrieving and displaying data, LL is better for manipulate (add, insert or remove).
Hey John. I was cording for past 10 years. Never ever thought about it. You are an eye opener. Wonderful explanation. Thank youuuuuu veryyyyyyy muchhhhh😄😄😄😄😄👍👍👍👍👍
I make sure to search your name for any Java concept I gotta learn, you explain things perfectly
Thank you, I was struggling to understand the difference and now is all clear. Btw I like your channel and I wish you to grow because you deserve it.
No problem at all. Thanks for the kind words, and thanks for watching!
ArrayList is really heavily used in Android as well.
i love Java, so sad some programmers are leaving it.. but i am glad, someone like you learn a java.
I have watched lots of video for understanding ArrayList and LinkedList difference but this video fix my all doubts.
Perfect timing I meant to ask you for this
I'm glad youtube suggested me your channel John. Your videos are truly inspiring, and quite useful for a beginner like me. I want to declare my appreciation for the work you're doing here =) Thank you!
This is the guy that makes life easy when it comes to Java .....Beautiful explanation 😄
Thank you very much, John! Your way of explaining java concepts is very straightforward to understand. Your videos are worth every second to watch.
As a non-native speaker and java beginner I recommend switching the audio pace to 0.75 ;D
otherwise great explanation!
This is like my operating systems course but condensed in the best way.
Thanks for the videos! ❤️
Bro, you are helping me a lot!
I am falling way behind in my Java class, and my teacher is not helping me.
Your videos are a boon!
thanks
Love your videos! been watching all of them to get prepared for my next job interview :P
Wow this channel is amazing. Subscribed! I have an interview tomorrow, and will definitely be using your videos to learn Java if it doesn’t go well!
Hope it goes well! And also hope you come back to learn more even if it does go well 😀
@@CodingWithJohn will definitely use your channel to learn!
@@CodingWithJohn I think it went well!! Will probably hear back some time next week! Thank you again!
This is applyable to C/C++ too and is usually an interview questiton (differences between Array and Linked lists)
Finally, a clear explanation, Thank you! You definitely earned my subscription.
Thank you very much. Quality of the lesson is really good. You are professional. Keep it doing! 👍👍👍
Thank you so much for explanation, i am us array list most of time. But i had read it multiple time but didn't understood it well. But in your end of the video when you gave example that made me understood. Now i know which to use when
This channel is tight. I was at a plateau until you happened to pop up in my feed. It's funny because I was scratching my head trying to figure out how to make my program with just arrays. It couldn't work because I needed something with an adjustable size, so I ended up finding your Array List video, and now I'm learning that Java has linked lists, which will be awesome for the spaghetti program I am making.
Awesome! Really glad the videos could help. And thanks for watching!
Ur explanation way are such incredible.Thank you bro . Definitely your channel will 1M subscribtion in the future....Can u say what type IDE r u using
This video is great!! 🎉
Dude, I love your channel, I hated Java a time ago but I've been working with php (some POO) and I've been opening my mind to Java too, I had to do a Project using Java to my College last month, and you helped me so much with your videos. Now I'm watching every video just because I started to Love it. Thanks Bro! Ps: I'm from Brasil, and my english isn't that good.
Thanks for the awesome video. I had bought some Java course on Udemy and I keep coming to your videos as you explain them in a much better way than those in Udemy.
Thanks John, good starting point for Java Coders in the intermediate stages looking to go advanced and being Java is applicable with mobile apps. Have posted on my twitter, Regards and keep these videos going. Mark
ArrayList: if your logic GET value frequently
LinkedList: if your logic INSERTS/ADDS, DELETE value frequently
Thanks for video! Im learning a lot. My goal for #2022 is Spring Certification and Java Certification.
You’re great man. Love your enthusiasm for Java. Keep it up!
You explain things so clearly, keep up the good work and Thanks!!!
First time watching your videos, very good explanation at helping me understand this!
Thanks for your tutorial they are helping me a lot in my Java studies. You are a genius.
Thanks a lot, barely could be clearer! Interesting as hell, can't stop watching :)
thank you so much for this tutorial. now I know what is really the difference between them. I hope you’ll grow your channel more. Please make a tutorial for Data Structures in Java as well. That would be really helpful
please please please dedicate an entire video to only LinekdLists and the Node class I am struggling with my midterm!!
Thank you for the comprehensive video with plenty of examples and thorough explanation!
The traversal of a linked-list is slower than shifting all the elements of an array list by one. So, with larger amounts of data modifying a linked-list becomes exponentially slower and produces many cache misses.
Good video, never really thought about this, and have been doing this for 7 years now
John is truly insane! Well explained!
farklı bir dilde olmasına rağmen çok başarılı bir anlatımınız var ,tebrikler
I'm glad there is that pinned comment. The video is technically (videographically) fine, but the content is really questionable. I'd also type the variables as List, it is universally good practice, unless you want to use specific methods (e.g. queue operations). And then there is that LinkedList theoretical usefulness:
1) One big trouble is that having an element and getting the internal list node are two different things. So in theory, remove is O(1) if you have the node. But you don't, so in practice it's O(N).
2) While going linearly through a list and then quickly removing a single element MIGHT be still faster than shifting stuff in an array, it hardly ever is because of memory co-location of array list elements (and lack thereof in linked list). Many array list operations are covered by the fastest caches in CPU, while the linked list jumps often all over the place evicting cache rows in the process.
Long story short, array list virtually for all cases. Linked list perhaps for some queue/stack tasks, unless you use something even better suited from other libraries. And measure before bold claims.
For queues and stacks, ArrayDeque is a similarly superior substitute for LinkedList :).
i have so much respect for you good sir. you are carrying my revisions
La mejor explicación del mundo mundial! Gracias!
You make very understandable videos, keep it up!
Your channel is amazing!
Love your videos, short and informative 👍
This is so clear and so helpful, thank you
Super clean & neat explanation 💕
Thank you so much for sharing these courses with us.
I have a question, when we add many objects to an ArrayList we know that it creates a larger internal list each time it runs out of space so, What happens to the previous internal lists that The ArrayList created before the latest one?
Ones again Thank you very much john, hope you can share your LinkedIn Account with Us : ) !
That's so cool. Loved your video. You got a sub mate !! 👏👏💖💖
Really appreciate your explanation , it was too clear and these concepts are pretty clear to me now
Loved the explanation! (And the Beatles) A channel worth subscribing.
As of late I've been getting into Java functional/lambda/reactive programming. Definitely took a little bit to get use to, maybe do a series on it?
i love you john
ur keeping me hungry for more knowledge
John single handedly carrying me thru cs class
John, you are awesome. Thank you for your work !
Thank you so much. Your videos are great and really easy to understand.
Thanks for clear explanations.
I exactly found out what I am looking for.
Array list - retrieval
Linked list - insertion, deletion
John thanks a million for your videos, can you do a video comparing Singly Linked List vs Doubly Linked List ? thanks a million!
What editor style do you use to have such bright colors for the code? Makes it very readable for this video. As always solid lesson and I left this comment for the algorithm!
This is Eclipse with a dark theme plugin called Darkest Dark. I think I have the color scheme changed to IntelliJ dark theme defaults, ironically enough. In more recent videos I've switched to IntelliJ and use the default colors, just tweaked to make the background darker and the colors pop a bit more in the videos.
Great video! I've actually never used either of these collections, as my java teacher had a preference for Vector and it stuck with me. So that leads me to a question: how do Vector and other collection classes play into the discussion and when would you use them over ArrayList?
Vectors are no longer recomnended in Java, old, and poor performance. According to java official documentation, avoid it
Thank you.
ArrayList = searching
LinkedList = adding/removing
Be sure to check out the pinned comment - ArrayList tends to be faster for literally everything 99% of the time due to modern architecture, even though theoretically it might seem that LinkedList should be faster for some operations.
Thank you john for your precious informations and waiting for the next ones😊
Amazing explanation, thank you
Great lesson! Thank you very much!