Dynamic Programming / en: pseudocode is incomplete

Unless I'm mistaken, the `if` statement at the bottom of the Longest Subsequence pseudocode doesn't actually do anything:

```
for i=0 to n-1
    LS[i]=1
    for j=0 to i-1
        if (a[i] >  a[j] and LS[i]<LS[j])
            LS[i] = LS[j]+1
for i=0 to n-1
    if (largest < LS[i])
```