Editing Patience sorting (section)

==History==
Patience sorting was named by C. L. Mallows, who attributed its invention to A.S.C. Ross in the early 1960s.{{r|Chandramouli}}
According to Aldous and Diaconis,<ref name=Aldous/> patience sorting was first recognized as an algorithm to compute the longest increasing subsequence length by Hammersley.<ref>{{cite conference |first=John |last=Hammersley |author-link=John Hammersley |title=A few seedlings of research |conference=Proc. Sixth Berkeley Symp. Math. Statist. and Probability |volume=1 |pages=345–394 |publisher=University of California Press |year=1972}}</ref> A.S.C. Ross and independently [[Robert W. Floyd]] recognized it as a sorting algorithm. Initial analysis was done by Mallows.<ref>{{cite journal |first=C. L. |last=Mallows |title=Patience sorting |journal=Bull. Inst. Math. Appl. |volume=9 |pages=216–224 |year=1973}}</ref> Floyd's game was developed by Floyd in correspondence with [[Donald Knuth]].{{r|Burstein}}