Blackjack Tips Information & Video Source:
MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Victor Costan
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Source: YouTube
Please can you explain what is PRINCALS algorithm
OMG that board should be clean properly!
I used to be pretty good at algorithms, but this confused me, rather than refreshing my knowledge about it..
Too large?
Where can I get the notes?
This is amazing. So useful and yet free of charge .
I don't understand what he is talking at 36.20, I have read the recitation note but can't understand as well. In order to find the kth smallest element, he build a new array Z and input the element in the original heap, and undergo extract_min in every loop. But the problem is, the root Z or Z[0] must be the minimum element in the array. I am confused did the array Z initialize every time the after extract min, which this make sense, Z would only contain elements within the horizon, but not containing every element in the of the original heap, else extract_min should only return the first element as this is what min_heap property.
Thank You MIT.
This is really amazing! Never thought we could get the top K element in K lg k .
Thanks you so much for giving high quality content