diff options
| author | Jim Meyering <jim@meyering.net> | 2003-08-22 09:46:16 +0000 |
|---|---|---|
| committer | Jim Meyering <jim@meyering.net> | 2003-08-22 09:46:16 +0000 |
| commit | 64bd38cf920f0a1fbe566fdec86a6808957fbb0f (patch) | |
| tree | fab1e9f26dff41391faeb9872d0e0931797ec815 | |
| parent | 2b99adb3bec1c836078a05b5e85ece33bc0001c3 (diff) | |
| download | coreutils-64bd38cf920f0a1fbe566fdec86a6808957fbb0f.tar.xz | |
*** empty log message ***
| -rw-r--r-- | TODO | 5 |
1 files changed, 5 insertions, 0 deletions
@@ -123,3 +123,8 @@ sort: Investigate better sorting algorithms; see Knuth vol. 3. algorithm to try next should be merge insertion. See Knuth section 5.3.1, who credits Lester Ford, Jr. and Selmer Johnson, American Mathematical Monthly 66 (1959), 387-389. + +Document the exit status of each and every program. + Suggestion from Dan Jacobson. + The sentence or two describing the common case must appear just once, + and then it must be made to appear in the 70+ places where it's needed. |