How to read code and determine big o and probably a data structures overview and when one's trivial over the other and also if we have a crown jewel that can be used anywhere for performance boost
Hi dude, first of all i love your videos :) I just wanted to say that in this one in particular i am missing some explanations about memory usage and efficiency. Small details like that you can access an array element in O(1) time complexity, and that is not like that in a list. Anyway i know you are starting with this channel and i know that you won't stop getting better and better which every video, keep on going!
Is that in memory space(object) contains including [ , , , ] or just the sequence of numbers ? Because in python everything is just a reference to a memory space.
This is a simplified view, but in general yes, linked list usually uses more bytes than an array to store a single element. Some Linkedlist even store a pointer to the previous node.
Comment what CS concepts/problems you want me to do next!
How to read code and determine big o and probably a data structures overview and when one's trivial over the other and also if we have a crown jewel that can be used anywhere for performance boost
Joma, i think i will be awesome if you can show about mathematically prove from coding questions like using induction
Dynamic programming
Hash table and hash functions. I think this is an interesting topic :)
More about data structure
0:50 - 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 - 9 units of memory. Okay, sensei :)
Is that wrong?
@@Notthetylor count them on your own again :)
@@Notthetylor it'll be 10 units of memory
Great work Joma, I'm very excited for this channel and series to grow!
exception thrown @ 1:38
90th subscriber! Awesome new channel Joma, can’t wait to see where this goes!
Hola Joma! So glad you're still helping your bois out!
I suspect that I’m about to learn to reverse a linked list... does the TechLead know what you’re up to, Joma?
Hi dude, first of all i love your videos :) I just wanted to say that in this one in particular i am missing some explanations about memory usage and efficiency. Small details like that you can access an array element in O(1) time complexity, and that is not like that in a list. Anyway i know you are starting with this channel and i know that you won't stop getting better and better which every video, keep on going!
I am so happy to see this,, u will be doing great here joma ❤️
Joma .. Love you initiative. Just keep going and it will be big.
This guy teaches so damn well!
Yeah And he not uploading anymore....
good to see ya here
@JomaClass could you kindly point to the video that talks more about what the differences between the two mean like you said.
good to see you teaching some cs :)
Does it mean that linked list take more space in memory? Then why would you use them?
Depending on the implementation, searching in or inserting to a linked list can be much faster than in the case of an array
50th subscriber 😉
Is that in memory space(object) contains including [ , , , ] or just the sequence of numbers ? Because in python everything is just a reference to a memory space.
So for a Ll each node is going to take up 2 spaces of memory? One for the value and one for the next nodes addr?
This is a simplified view, but in general yes, linked list usually uses more bytes than an array to store a single element. Some Linkedlist even store a pointer to the previous node.
yeeey knowledge
Thank you
Joma is the next Khan Academy
Nice
What is an array 😵
Hi Joma good video. Which programm u use
To make these videos? Photoshop
What app do you use for your graphics?
Second like on Joma’s new channel. I have never felt closer to God
looks kinda like... khan academy ?
❤️
Hi
3, 1, 1
Honestly arrays are much more easier
Algorithms search..
Give me your email id, i have problem for you, its quite big, you can make a video on that, and explain it as well..