Man, I must say you have a awesome video, I really enjoyed watching your video on linked list, I am taking a java class that is teaching me linked list this week, this video rocks!
Lets say in a linked list there are 5 elements, how can we delete the third element with an efficiency of O(1)? Traversing upto the third element will take up O(n), is that correct? Then we would set its pointer to null, and then set the pointer of 2nd element to the fourth one as its next?
The video is one of the best I've seen, very informative.
I was referring to deleting the kth element from an arbitrary list of length n.
Also is it possible to have a video just dedicated to the efficiency of different data structures, and pointers to any other links would also be helpful.
My next video is specifically on big O, analyzing runtime, and reasoning about algorithms. Unfortunately I've been pretty swamped this semester and haven't had much time to make it. Thanks for watching.
Great :)))
surajgenius 2 months ago
What is the difference between a linked list and an array?
cechmaster 2 months ago
Thanks you so much buddy!
ClayREZify 1 year ago
Man, I must say you have a awesome video, I really enjoyed watching your video on linked list, I am taking a java class that is teaching me linked list this week, this video rocks!
daFranch1se69 1 year ago
You sound like throwing-up. I guess u made this video right after having a heavy meal...lol.....other than that, 5 stars!
shoofeer1 2 years ago
Excellent tutorial, thanks.
Lets say in a linked list there are 5 elements, how can we delete the third element with an efficiency of O(1)? Traversing upto the third element will take up O(n), is that correct? Then we would set its pointer to null, and then set the pointer of 2nd element to the fourth one as its next?
brilliantlights 2 years ago
Well technically if your linked list had a size of 5 elements the time to delete the 3rd would always be the same, it would have O(1) efficiency.
However deleting the kth element from an arbitrary list of length n will take O(n) time. Did I mistate this in the video?
Theotherguy1989 2 years ago
The video is one of the best I've seen, very informative.
I was referring to deleting the kth element from an arbitrary list of length n.
Also is it possible to have a video just dedicated to the efficiency of different data structures, and pointers to any other links would also be helpful.
Thanks for the very educational video.
brilliantlights 2 years ago
Thanks.
My next video is specifically on big O, analyzing runtime, and reasoning about algorithms. Unfortunately I've been pretty swamped this semester and haven't had much time to make it. Thanks for watching.
Theotherguy1989 2 years ago
very good demonstration
mrsmadhavip 2 years ago