|
|
|
|
|
|
by taspeotis
3920 days ago
|
|
|
Trivia: this was the most efficient known algorithm until 2008 [1]. > 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. [1] https://en.wikipedia.org/wiki/Pancake_sorting |
|
|