Barack Obama - Computer Science Question
Channel:weedipikia · Length:1:25 · Published:2008-01-26 · Views:1160448
Summary
A one-minute clip from Barack Obama's 2008 Google visit in which Eric Schmidt asks him the most efficient way to sort a million 32-bit integers. Obama answers that bubble sort would be the wrong choice.
Why HN recommends it
Used as a joke or aside about bubble sort and as evidence that Obama was tech savvy, not as something recommended for its content.
Algorithms & data structures · Tech pioneers & interviews · US politics & elections
Subtitles (excerpt)
um now now Senator you're here at Google and I like to think of the presidency as a as a job interview now it's hard to get a job right as President right and I you're going through the rigers now it's also hard to get a job at Google right we um we have questions and we ask our candidates questions and uh this one is from Larry schwimer okay what you guys think I'm kidding it's right here what is the most efficient way to sort a million 32bit integers well uh I'm maybe I'm sorry maybe no no no I think I I I think uh I think the uh the bubble sort would be the wrong way to go uh come on who told him this okay I didn't see science we've got our spies in there well why not let's okay let's ask let's ask a a different interview question um and more obviously more serious um you're you're you're you're you're not notable in this campaign for your steadfast opposition to the Iraq War right uh
On Hacker News
While I'm sure the President doesn't research all laws he signs, Obama is somewhat tech savvy. [VIDEO] I wouldn't be surprised if he made the threat based on his own personal moral ideology. — mortdeus, 2013-04
I get your point, but why would you pick bubble sort? That’s one any engineer should be able to implement without any help. It’s the more complex/useful ones worth discussing. Even Obama knows this: [VIDEO] — dickeytk, 2019-11
Bubble sort is never a good choice unless so extremely lazy or what to impersonate Obama...[0] There are dual-pivot quicksort, smooth sort (in-place, based on Leonardo numbers and takes O(n) time to process a presorted array and O(n log n) in the worst case, and achieves nearly-linear performance on many nearly-sorted inputs), TimSort (that's stable as plus). Morealso changing stable to unstable … — xxs, 2018-05
Related videos
- George Lakoff: Moral Politics · University of California Television (UCTV) · 58:57
- Jim Simons (full length interview) - Numberphile · Numberphile2 · 1:00:43
- Steve Jobs Stanford Commencement Speech 2005 · JoshuaG · 14:34
- Why Electronic Voting Is Still A Bad Idea · Tom Scott · 12:00
- Republic, Lost | Lawrence Lessig | Talks at Google · Talks at Google · 57:19
- Alan Kay - Normal Considered Harmful · powerfuloutlet · 1:07:26
- Antonin Scalia - On American Exceptionalism · AmericanRhetoric.com · 7:21
- Growing a Language, by Guy Steele · Bill Pugh · 53:31
- A Philosophy of Software Design | John Ousterhout | Talks at Google · Talks at Google · 1:01:40
- "Uncle" Bob Martin - "The Future of Programming" · Paul Stringer's Mobile Tech · 1:18:21
- CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step” · CppCon · 59:33
- The Cardboard Box Reform - Nixon's Ghost Bill & A Crucial Flaw in Democracy · CRI · 1:02:37
- VCF East: Ken Thompson interviewed by Brian Kernighan · Vintage Computer Federation · 1:03:51
- Hamming, "You and Your Research" (June 6, 1995) · securitylectures · 44:02
- Tech Talk: Linus Torvalds on git · Google · 1:10:15
- Alan Kay's tribute to Ted Nelson at "Intertwingled" Festival · TheTedNelson · 17:33