Regarding th-cam.com/video/14g1YBvx8Co/w-d-xo.htmlm45s Linked List without References where you store the nodes in four arrays and keep the integer values of head/tail indexes, wouldn't the traversing of this linked list be O(1) operating since you can do pointer arithmetic on the array index? Compared to the linear time traversing of regular linked list?
But, you don't know where to look. In that example, if you want the 5th item, you start at index 4, which sends you to 11, and then 7, then 2, then 8. While you have direct access to the item in the array at index 8, without following that chain from the beginning, you wouldn't know that you should be looking at the item in index 8 for the 5th item of the list.
This is the most underrated channel on TH-cam
+Gobberfisch In time, it will climb to be the 9th most underrated channel.
Dear professor Taylor, even though I failed your class TWICE, I am still very thankful for your education.
You are the Boss and your Humour is good. Keep up the great work!
Awesome!!! I learnt so much from it!!! Many thanks to Professor Taylor!
Hey good video man! Hope I get off the waitlist!!
I think this guy has a promising future in education... :)
He hopes so, but he's getting kind of old, so that future better start showing up soon.
Thanks for the video. It helped a lot. At 11:45, is that the underlying data structure of a list in Cpython?
I doubt it. I think modern, high-level languages generally have pointers or references available. Maybe Fortran didn't, prior to 1990?
very helpful.
hey man great tutorials. Can you do a video on skip lists and skip graphs?
I won't be able to get to that for a long, long time, maybe 7 years? (Seriously.). Too late for you, I am sure. Sorry.
Thanks, I guess?
Regarding th-cam.com/video/14g1YBvx8Co/w-d-xo.htmlm45s Linked List without References where you store the nodes in four arrays and keep the integer values of head/tail indexes, wouldn't the traversing of this linked list be O(1) operating since you can do pointer arithmetic on the array index? Compared to the linear time traversing of regular linked list?
But, you don't know where to look. In that example, if you want the 5th item, you start at index 4, which sends you to 11, and then 7, then 2, then 8. While you have direct access to the item in the array at index 8, without following that chain from the beginning, you wouldn't know that you should be looking at the item in index 8 for the 5th item of the list.
Algorithms with Attitude I see. Literally the next video in the playlist talks about indexed arrays.
almost got 86'ed hahaha xD
hahaha, private nodes