I have the difficulty understanding the skip point example, what if fish lists as 1,2,5,45, 46,... and B is still the same, then when blue find 32 and fish find 5, fish advances to 46, here would 45 be missed. So when A < B, then A advances, if we see A > B, shall we do backtrace A ?
I believe the skip term is misleading. It is still O(m+n) where m and n are numbers of documents in first and the second lists. By "skip" he refers to not do anything with the value and traverse to the next.
Great content indeed..thanks for the details
Excellent explanation.. Thanks.
We need more of like this content
I have the difficulty understanding the skip point example, what if fish lists as 1,2,5,45, 46,... and B is still the same, then when blue find 32 and fish find 5, fish advances to 46, here would 45 be missed. So when A < B, then A advances, if we see A > B, shall we do backtrace A ?
I believe the skip term is misleading. It is still O(m+n) where m and n are numbers of documents in first and the second lists. By "skip" he refers to not do anything with the value and traverse to the next.
please read skip list Data structure using that you can have some skipping in linked-list obviously it depends on your needs.
Awesome Video... Thanks a lot..
Man thank you so much
nicely explained.........thanks a lot.....:)
excellent
WHERE IS THE BLUR WEBSITE..IT DOESNT EXIST ANYMORE??..ok thxz
ok i got it.thxz
great presentation but whoever is taking this video has to learn the basics of taking a video..just werid