There is a broad circle of ideas relating to the length Ln of the longest increasing subsequence of a random n-permutation. After reviewing known results and methods, we develop two new themes. The simplest algorithm for computing the length of the longest increasing subsequence can be viewed as a card gard, patience sorting, and one theme is to give the first asymptotic probabilistic analysis ...