Obama Knows His Computer Science
tags:
Stumble ThisObama fields a question intended for a Google interviewee and gives a surprisingly knowledgeable answer.
X Greetings! You are not currently logged in, but please don't let that stop you from voting up any videos you like. :)
|
| |||||||||||||||
obama,google,computer,science,bubble,sort Obama Knows His Computer Science
Comments  who voted for this video hixsonj
- siftbot
x97Obama Knows His Computer Science Related Videos
| Watch this Video NextFriends O' the Sift Top New Videos by Vote  Subscribe Top 15 Sifters of All Time Top 15 Sifters of the Past Week Newest Appreciated Comments          | ||||||||||||||
well.., ok, so he won, but you know what I mean.
http://en.wikipedia.org/wiki/Bubble_sort
>> ^DrPawn:
If its not a total duplicate why even complain about it ? A short clip of an interview is totally differant then the whole thing. It obviously highlights something very interesting. Boo the dupe fairys.
Because a dupe is a dupe is a fucking dupe. Just because it's a shorter clip doesn't make the other content disappear.
- OBAMA'08 -
We've got spies at Google
from the FAQ [emphasis added]:If you want the rule changed to make an exception for short bits from existing long posts, then post to Sift Talk to get some discussion going. But please don't flaunt this rule, as it will inevitably lead to this kind of fiasco.
Video is not a dupe because it was published on Feb 15th (the other vid was published on Feb 16th).
Goldies, please be careful when firing off discards, thanks.
Poster child - http://www.videosift.com/video/Ralph-Wiggum-is-a-Unitard
Krupo - if that is the case, then it needs to be added to the FAQ.
[edit] bamdrew, re: your example - full episodes of conan shouldn't be getting posted anyway. The general point is well taken though.
I watched both vidoes. And the first is about a 15 minute bore fest.
Dupe fairys, I respectfully disagree with why this video has to be deleted. I see your point that it violates the rules. I just differ in the interpretation of duplicate content when this video clearly brings something "new" even if the new is only it highlights Obamas computer literacy.
And don't be immature and get all YouTube on us by calling us "dupe fairies" just because we like to adhere to the rules. It's what sets this site above the rest.
Basically what I'm trying to say is it's impressive but not the so-impressive-he-must-have-been-told-ahead-of-time impressive.
My bad folks - I did not intend to discard this. I didn't realize a blockquoted invocation would get carried out, nor did I even particularly notice the ' ' in the quote. I'll promote this back tomorrow when I have the power point available again.
Krupo - if that is the case, then it needs to be added to the FAQ.
[edit] bamdrew, re: your example - full episodes of conan shouldn't be getting posted anyway. The general point is well taken though.
LOL, I didn't realize the discard was in the quote. Yeah, treat the * like a live bullet around all words at all times. Sorry for harshing on you.
Regarding the exception, it's a Sift Convention. As we're all aware, laws and rules can either be handed down as a formal written policy, or in something more akin to a tradition.
The Unitard Convention or more of the latter, and the reasoning behind it is buried in the Sift's comment database. We can always google is out if we really need it.
Thanks for the fix dag.
What do you all think would be the best answer?
Off the top, without knowing the answer to "efficient how?" or "sorted how?" I vote R-B tree.
On the other hand if "efficient" means minimum memory usage, you would probably have to go bubble sort.
As for the actual algorithm that would be used, Quicksort is probably the most obvious choice, although they did not specify what their sorting goal was, so "It depends." is probably a fine answer.
when compared with just the clip. Clearly, neither is a dupe.
There is never a good reason to do a Bubble Sort. The only reason anyone ever learns it is because it is used as an "easy" introduction to writing algorithms in Computer Science 101 courses.
Bubblesort is not always the wrong answer. For instance if "efficient" means using only 32Million bits RAM, two 32bit registers (plus the hacky use of an execution counter), and a few dozen lines of assembly, you can't really implement anything else. The answer is based on the constraints.
That being said, now that I think about it, loading and dumping an R-B tree is logically equivalent to quicksort, which does seem like the best general solution.
The best way is not to sort them at all but count them!
So you could store the entire sorted data set in one object oriented variable, lets call it dataset.
dataset.999=25
dataset.998=22
dataset.997=18
....
This means that there were 25 3 digit intergers that were equal to 999 and 22 that were equal to 998.
The dataset would require only a 1000 integers to store.
The question about how to sort a million 3 digit integers is interesting and misleading.
I think he said 32bit integers, not 3 digit integers. Radix sort, or in the absence of associated data, simple counting, as you suggest, would be very bigO efficient in that case.
grin @ "dupe fairies" and related funniness.
President...not so much.