Added: 4 years ago
From: weedipikia
Views: 681,218
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:

All Comments (1,283)

Sign In or Sign Up now to post a comment!
  • Good, I like that you share this video, I wish success always Barack Obama gets asked a computer science question by Google CEO Eric Schmidt.

  • Damn Obama hating on bubble sort :/

  • I Love The Video It Can Increase My Knowledge Barack Obama gets asked a computer science question by Google CEO Eric Schmidt.

  • Nice Video That You Share , So Very Nice Thanks You Barack Obama gets asked a computer science question by Google CEO Eric Schmidt.

  • I Really Like The Video From Your Barack Obama gets asked a computer science question by Google CEO Eric Schmidt.

  • Your Video Is Very Useful Sharing Barack Obama gets asked a computer science question by Google CEO Eric Schmidt.

  • class president

    { int year;

    }

    psvm(String args[])

    { president Ron Paul= new president (2012);

    }

    ... duh.

  • @deathslayer101 //error = president Ron Paul

    { unrecognized command }

    /system failure

    /system failure

    /system failure

  • @Jayjon81 fuuuuuuuu.... dam mayan calendar ....

  • Saw your own video like 100 intervals ...

  • is everyone reading this stuying programing or computer science?

  • Radix sort, ofc.

  • @TheFuturePoet Lol. That'd take up so much ram. You'd need an array from 0 to 2^31-1, But I suppose Google has plenty of RAM to spare.

  • @fiend7777

    I believe you'd only need 2 arrays, both of length N, where one contains the input and the other is a temporary.

  • How one can alter movie clips so fantastic as you may do

  • Saved to fav your entire tube channel and viewing it on a daily basis !!!

  • As a final point not junk high quality video !!!

  • I love your work.

    please check out the trailer for the novel WIth These Eyes.

    A global computer network serves as the tool by an agressor to track a journalist who is about to uncover the secret of Quantum Energy.

    please give me a "Thumbs up" and subscribe if you like what you see.

    peace and love

  • You've done good job with all of these kinds of videos .

  • Remember to write about link to all your hub pages web page ...

  • lol awesome

  • Good film

  • Seriously many thanks for work .

  • If I get married to You tube yt channel your own ...

  • If this type of youtube channel is not really amazing I not really know what is !

  • nice question, lol. Obama is fun!

  • that was a great answer, the man didnt avoid the question but he deflected it by saying what wasnt the answer. genius i tell u

  • people hate the governement lol XD....why cant we all unite and be nice <3

  • Fuck u nwo scum

  • Holy sh*t how do you guys know all the stuff?? Are you all computer science

    Majors or something???

  • i'd say 7zip lol

  • "We got our spies in there" It's funny because it is true.. :p

  • @arabsforever I'd say Google has them right back. One hand watches the other.

  • what a beast! so wish that he knew that himself aswell!

    radix sort all the way

  • Comment removed

  • Radix sort fool

  • @satshabadkhalsa Quick sort will take more operations, but will run in less time as radix will have more cache misses. Try it :D

  • cool!!

  • reorder data out-of-place with each stage with a separate bit/digit reversal and O(N log N) storage algorithm.

  • Scripting:

    Makes a person look intelligent, when it really makes them look trainable.

  • Quicksort has an efficiency of about O(n^1.2).

    It's radix sort you fools, it has an efficiency of O(n).

  • @Goronzrus the first thing that came to mind for me was mergesort, which is O(n*logn). He said most efficient, not fastest. Radix sort with a million 32-bit integers would take up a considerable amount of memory, no?

    I suppose it depends on which is more important.... for google I guess memory isn't an issue.

    Ok, you're right.

  • Comment removed

  • Quick sort I guess.

  • For a generalized list I'd say shuffle the list then use a Quicksort, but if the list was already *almost* sorted (which isn't uncommon) then actually a bubble sort may not be a bad idea.

  • @h1gifford Bubble sort is always a bad idea unless you need to hack something quickly.

  • @FangFiftyFive Not necessarily. If the list is very short then a bubble sort has a smaller overhead than a merge or quick. Or if you were using the algorithm in an embedded device where every mW of power mattered and you were only sorting short lists, then again a bubble sort may be better. Choosing the right sort depends a lot on what you are using it for.

  • Comment removed

  • @h1gifford Just be glad he knew what bubble sort even is, comming from someone who hasn't studied computer science and stop playing the smartass.

  • @h1gifford Besides, a million says it all --'

  • Quicksort FTW/

  • Herman Cain could have actually answered this probably. (He has a masters in computer science).

  • @itsbackfliptime

    Are you serious? I call bullshit!!

  • Binary search?

  • @reid300 that's a search algorithm not a sort

  • @bebookspacebuzz sorry put into binary tree*

    

  • @reid300 Only if it's self-balancing...

  • Hmm, I'm thinking radix sort.

  • awesome

  • interesting talk!

  • nice vid

  • Obama makes no decisions, the congress make the decisions, there is really no NEED for a president.

  • @MrHaithamE There is a psychological need for a single leading figure in the less reflected and thus major part of society. It's the way evolution made us work. The concept of congresses (or better parliaments) who govern millions of individuals is a very recent development, which our brains - at least in their uneducated form - aren't well accustomed to. So if you want the majority to follow, and not riot (i.e. find local alphas in small clusters), you need to present a leader.

  • is the answer something like heap/quick/merge or is it something else like bucket?

  • @Xealous Bucket is not for sorting.. It's just a way of storing data(associative array). If I were asked this question I would reply with a question: Are the integers randomly positioned in the set or do they follow a pattern? If the integers are randomly positioned in the set then I would go with any nlogn algorithm.

  • with an aray

  • loop?

    array?

  • is the answer a merging technique where you divide the integers into 2 seperate lists sort them and then merge the two because in reality it would take Theeta n log n if you were to express it in engineering terms. Im guessing theres better ways but im a noob.

  • @galloan

    Yeah, like merge-sort. Divide and conquer. You partition the list and sort each half by recursively partition them and merge back together. Runs in nlogn time.

  • why is everyone laughing

  • more evidence to suggest that Obama has an ever-present earpiece which other use to pitch him lines.

  • scripted

  • Quick sort go!

  • @Hardy123Zhao Only when the number of integers is low, For higher number of integers use heap sort.

  • Always Heapify

  • President Obama nice with computer science

  • he's so cool lol

  • obviously the correct answer is quantum bogo sort

  • @HLGDecoy quantum bogo sort is still Θ(n) though isn't it? Because you still have to iterate through the list to check if it's sorted. Then it's really no faster than radix or counting sort which are O(n).

  • For some weird reason this reminds me of a interview with justin bieber, the way he looks into the audience the way he sits.... am I weird? XD

  • The google guy is sooo autistic.

  • @boredmonkey29 What makes you say that...

  • alphabetically...

  • radix sort :)

  • @NeshaTheBest I'll second that

  • I'm going with merge sort.

  • answer is quicksort

  • Depends on what the numbers are :)

  • well, if the array was already sorted, Bubble Sort would be a great option (O(n) time). Otherwise, merge sort. 

  • He clearly should have used Quantum Bozosort.

  • "Computer Science Question " ???? No. just something HE made up when HE is not a computer scientist.

    The computer science question "whats the most efficient way to sort a large list of integers ? ". because a real computer scientist would know it didn't matter to specify the exact size of each, or overall size...

  • @isilder Actually the size of the list does matter. For small lists, insertion sort is in practice faster than any of the nlogn sorts. For larger lists, quicksort is fastest in the average (but not worst) case. For really large lists (too big to fit in memory), mergesort is best. For a million 32 bit integers, quicksort would usually be fastest.

  • @isilder

    Actually, it does matter. If you are using arbitrary precision integers (or large strings), you probably want as few comparisons as possible.

    Then there are some other things which can help how you sort.

    If the integers are unique (that is, they only appear once) and in a relatively small enough range, it can be done in O(n) with a bit array.

    Additionally, if you have a truly enormous number of things to sort, you'd probably want to use polyphase merge sort.

  • @SalamanderBSC It can even be done in O(n) if you have lots of integers and they are non-unique, as long as the integers are in RAM (access/write times O(1)). Radix sort achieves this.

  • radix ftw

  • I am from Serbia (that far) and still I can tel that the President is sitting on the right-hand side :)

  • interand

    { 3*3.14;}

    Bubble sort.

  • Why are you bubble sorting the government's finances?

  • Barack, you totally bubble sorted the Iraq War after you became President.

  • @Kamyanets He bubble sorted the Iraq War? No wonder it took so long to get out of there

  • Bubble sort would be good O(n) if the integers were already sorted! if the integers were nearly sorted, insertion sort would probably do well.

  • @idoljaysmith Bubble sort runs O(n^2). I'd use merge sort

  • @BlackNine313 yes but the best case is O(n)

  • bucketsort.

  • Nobama!

  • in retro. obamas whole personality shtick is see through and lame

  • lol @ obama turning his head to look at the teleprompter. Learn to peripheral vision?

  • @bondservant4Him Merge sort is best at sorting when n is large(i.e. 1 million), for a very small n(10 or so) other sort methods may actually complete quicker than a merge sort on the same set of numbers.

  • Why did you change your mind about Iraq, Obama? D:

    You threw so many exceptions in your campaign promises and failed to catch them.

  • @ccricers Lmao!

  • @ccricers I luled so hard.

  • @ccricers

    Because when it comes to governing Obama is an actual pragmatist. You should be happy America didn't elect and ideologue like Bush.

  • @tubub hes put us 1.4 trillion deeper in debt, ill take bush again please...

  • @tubub Yeah, pragmatic wars, pragmatic bailouts, pragmatic inflation...

  • Can I jerk off about time complexity too? We should use bucket sort which is O(n) which we can do since 32-bit integer is of finite size and hence has finite buckets.

  • he only said the wrong way of going about it, which algorithm would be the right one??

  • @bondservant4Him Merge sort, invented by John von Neumann and used extensively by Google (time complexity O(nlogn), as opposed to bubble sort's O(n^2))

  • @bondservant4Him Merge or quick sorts most likely.

  • The black man is rapping at 0:58

  • Even the Prez is getting educated on Software Engineering :) For those interested in a deep discussion, check out MemoryLeakDMS channel

  • if you need to 'sort' world problems, then get out of everything America!

  • LOLOLOL OH MY GOD OBAMA AT GOOGLE AND HE ANSWERED A COMPUTER QUESTION LOLOLOL SO AWESOME BEST PRESIDEANT EVAR LUL XD

    Get the fuck out.

  • Make a sieve that increases size allowance as time folds; meaning send each entry to a independent process area; so a million or so simultaneous processes; then increase size of the size allowance send it through again. The idea is that the list would reassemble increasingly sorted. But there would need to be measures to accelerate the process, like the sum weight of all entries and the method of compensate for the size allowance that reveals no sortier(better sorted) list.

  • if there are 2 items to be sorted, than bubble sort it ok.

  • LOL @ the mention fo the iraq war at the end.

    he changed his mind a year in.

  • This guy is such a good bull shitter then again every president is. Nothing but a figure head.

  • Wow. I can't believe President Obama knows about sorting techniques.

  • @johnverco Too bad he doesnt know much of anything else.

  • @Soap360 or so you say

  • @qpSubZeroqp Or so I do say.

  • @johnverco he doesn't, he knew he was going to be asked that question and was told that answer

  • @andrew2372 yes falsifying a qualifier question allows him to make conjecture on other things he is not qualified to make statements about.

  • @johnverco did you watch the video? he doesn't

  • Didn't Schmidt notice the teleprompter?

    Garbage in, garbage out.....in 2012

  • I would have use quantum sort. ^^

  • Good luck with bubble sort.... Quick sort is a way to go :D

  • If you didn't get it, know that there are 10 types of people in the world:

    Those who understand binary and those who don't ;)

  • I dont get it.

  • @Ther3tr0 bubble sort is the simplest sort algorithm, but the most inefficient one. to sort a million integers, that would take 1000,000,000,000 iterations. but if you use other methods like merge sort or quick sort that would be of the order 6000000 iterations.

  • @KafshakTashtak potentially 1000,000,000,000 x) O(N^2) is a worst case scenario.

  • @KafshakTashtak it actually depends on the way that the bubble sort is implemented. As it turns out, the parallel implemetation of the bubble is one of the most efficient ones.

  • @xxStardaSxx I don't know about parallel method of implementation, but generally between sort algorithms bubble sort is the worst. But in that case I think other sort would work great in parallel too.

  • OBAMA ALL THE WAY

  • Radix Sort FTW!

  • lool

  • BUBBLE SORT FTW

  • staged

  • What's obama doing at google? I'm sure he'd have no trouble finding a job at a GM dealership rotating tires. GM would love to have him, after all the bail out money that he gave them..

  • @studolf look at the date, it was before he was president, so he was campaigning

  • bubble sort is good thinking.

  • @flowewritharoma

    He said NOT a bubble sort...

  • Comment removed

  • I like how in the end, the interviewer says that hes notible for his opposition to the iraq war.

    but lmao, its almost 4 years AFTER HE WAS ELECTED, and we still have troops in afaganistan, iraq, and now lybia.

    Hypocrite much.

    ps: i dont like obama, so of course that makes me a racist.

  • @minion6500 we don't have troops in Libya

  • @Chunbiii no not troops, but we have spent nearly a trillion dollars bombing them

  • There are only three types of comments on this video.

    1) People laughing and enjoying the video

    2) People having political discussions

    3) Computer scientists trying to answer Eric Schmidt's question

  • @MeBeMat I'm category 3. XD

  • @MeBeMat I like hammocks.

    4) non sequitor smart ass answers...

  • @MeBeMat 1) and 2) and 3) are not exactly disjoint sets

  • We need to word correctly in Computer "Science". What the heck is a Software or Hardware? What the heck is an audio device? Isn't any speaker on a Computer an Audio "Device"? What the heck is a Driver?

  • @SpellboundSolution @gnossticc you both have officially lost the internet. You can turn in your card at the Internet police office by Wednesday.

  • Comment removed

  • wait who asked the question? The google CEO is who? The guy who asked the question or the guy telling obama the question

  • That's it?

  • Here the question when are you gonna do something any good.oh oh i got a quetion FUUUUUUUUUUCCCCCCKKKKKKK YYYYYYYYOOOOUUUUUUUUU

  • The real question is: Will it blend ?

  • Let's see Obama use the Bubble Sort Algorithm to sort the following objectives from least to most important

    1) putting citizens in prison for smoking pot

    2) preventing another financial / housing bubble (may be too late, but what if..)

    Oh, wait... I kinda already gave away the answer.

    I still doubt he'll get it.

  • Bubble sort isn't quite the worst sorting technique. The worst one I know of it the Random Sort. Basically you randomize the list and then check to see if it's in order. If not, randomize again and repeat until it's sorted properly.