Categorized | Video Gallery

Barack Obama – Computer Science Question


Barack Obama gets asked a computer science question by Google CEO Eric Schmidt.

Share

25 Responses to “Barack Obama – Computer Science Question”

  1. ManwithanF1 says:

    If certain integers are repeated often, use Radix Sort. If there are not many repetitions and a wide range of numbers, Merge Sort or Heap Sort are the way to go. Quick Sort, depending on how it is implemented, is usually the most versatile.

  2. Flashware says:

    @cyanidesan Is it realy about .. “coolness” ?

  3. Hermetiqa says:

    @bob47910

    “probably”

    Taking shortcuts while typing makes you seem less educated than you probably are.

  4. bob47910 says:

    @Hermetiqa lol thats prbly right

  5. PatrickMoog says:

    damn, we can’t make fun of the American president anymore… stupid smart president… :D

  6. slapmetalbassftw says:

    @MissMidnitetoker i dont know, he kinda of looks familiar, i think i’ve seen him on tv running a nation somewhere… but i could be wrong

  7. herojohan88 says:

    Google got owned ? :P

  8. Hermetiqa says:

    This was a setup. Political pandering to the geeks.

  9. michaelyc1616 says:

    @MissMidnitetoker Who’s MissMidnitetoker?

  10. michaelyc1616 says:

    @MissMidnitetoker Who’s MissMidnitetoker?

  11. savicprvoslav says:

    1: question
    2: obama looks at his right reads answer , touch his eye and acts smart :)

  12. irgifted says:

    Radix sort.

  13. sharavsambuu says:

    He is awesome!!!

  14. temporaldisplacement says:

    ….I didn’t understand the question? 8( …oh well. lol

  15. MrDogbert2 says:

    @MyOverflow

    Hahahaha. I love it.

    Personally, I’d break it down into sets of 10,000, perform quick sort on each set, and merge sort it back together.

  16. MissMidnitetoker says:

    Who’s that black dude?

  17. BrandMan211 says:

    @gorgolyt It seems extremely staged, and I’m ok with that. We specialize for a reason. Also, I am a programmer and until this I didn’t know what bubble sort was (I mean, I’ve obviously thought of that method, but I didn’t know its name).

  18. MyOverflow says:

    Most efficient way to store 1,000,000 32-bit integers?

    Easy! Store it in an array and sort it using bubble sort, and save in a plain text file, with all entries separated by a pipe character. That would definitely be the most efficient scheme for storing all 1 million 32-bit integers.

  19. uzername90 says:

    @echoesintoeternity Quicksort.

    Because, fuck it.

  20. Cresey87 says:

    @Lewis1711 rapist?

  21. echoesintoeternity says:

    @sam9524 parallel merge sort (if all you care about is the time), on-disk merge sort ( if u care abt memory and number of processors available)

  22. sam9524 says:

    LOL! whats the right answer?

  23. gorgolyt says:

    the people who are screaming that this is patently fake may just be generally undereducated and hence be underestimating the possibility that he would know this.

    i know nothing about programming but when i heard the question the first thing i thought was ‘bubble sort’.

    considering his response was just a pretty vague way of mentioning the phrase ‘bubble sort’, and considering he’s an educated guy, i hardly find it impossible that this is genuine.

  24. lemonrind says:

    @westmerville What an excellent computer science related comment.

  25. xNIHDx says:

    lmfao charming!?

    HE fucking meant to be the anti christ is a charming guy!!

Trackbacks/Pingbacks


Leave a Reply

CommentLuv Enabled
4 All Memory Autumn/Fall Promotional Banner

Who's Online

9 visitors online now
0 guests, 9 bots, 0 members
Map of Visitors
Powered by Visitor Maps

Microsoft Store