Re:Bounds for Sorting by Prefix Reversal by William H. Gates...
by aarestad on Thursday October 01, 2015 @11:32PM
(#10316576)
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 "pancake flips".
[ Parent
| on HN ]
There are no comments on this comment yet.