TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Bounds for Sorting by Prefix Reversal by William H. Gates (1979) [pdf]

43 点作者 dennisbest超过 9 年前

5 条评论

hendzen超过 9 年前
Christos Papadimitriou was asked about this paper in a recent interview[0] - his response is below:<p>------------------------------------<p>When I was an assistant professor at Harvard, Bill was a junior. My girlfriend back then said that I had told her: &quot;There&#x27;s this undergrad at school who is the smartest person I&#x27;ve ever met.&quot;<p>That semester, Gates was fascinated with a math problem called pancake sorting: How can you sort a list of numbers, say 3-4-2-1-5, by flipping prefixes of the list? You can flip the first two numbers to get 4-3-2-1-5, and the first four to finish it off: 1-2-3-4-5. Just two flips. But for a list of n numbers, nobody knew how to do it with fewer than 2n flips. Bill came to me with an idea for doing it with only 1.67n flips. We proved his algorithm correct, and we proved a lower bound—it cannot be done faster than 1.06n flips. We held the record in pancake sorting for decades. It was a silly problem back then, but it became important, because human chromosomes mutate this way.<p>Two years later, I called to tell him our paper had been accepted to a fine math journal. He sounded eminently disinterested. He had moved to Albuquerque, New Mexico to run a small company writing code for microprocessors, of all things. I remember thinking: &quot;Such a brilliant kid. What a waste.&quot;<p>[0] - <a href="http:&#x2F;&#x2F;awards.acm.org&#x2F;info&#x2F;papadimitriou_4558987.cfm" rel="nofollow">http:&#x2F;&#x2F;awards.acm.org&#x2F;info&#x2F;papadimitriou_4558987.cfm</a>
评论 #10316901 未加载
评论 #10316892 未加载
评论 #10316782 未加载
taspeotis超过 9 年前
Trivia: this was the most efficient known algorithm until 2008 [1].<p>&gt; On September 17, 2008, a team of researchers at the University of Texas at Dallas led by Founders Professor Hal Sudborough announced the acceptance by the journal Theoretical Computer Science of a more efficient algorithm for pancake sorting than the one proposed by Bill Gates and Christos Papadimitriou. This establishes a new upper bound ... improving upon the existing bound ... from 1979.<p>[1] <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Pancake_sorting" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Pancake_sorting</a>
pvg超过 9 年前
...and Christos Papadimitriou (also not some random unknown slouch) - <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Christos_Papadimitriou" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Christos_Papadimitriou</a>
ap22213超过 9 年前
Wow - the guy&#x27;s simply amazing.<p>So, what would I do if I was as smart, rich, and old as billg? I&#x27;d invest in things that exponentially accelerate the rate of collective Human scientific and technological progress. Then, I&#x27;d sit back, relax, and wait for a cure for old-age to appear...
aarestad超过 9 年前
I appreciated how easy it was to read, at least until it got to the formal proof. This might be a good interview question to pose - to ask the interviewee to come up with the trivial lower and upper bounds of &quot;pancake flips&quot;.