(linenum→info "unix/slp.c:2238")

test

2008-01-07

_ hello/2.3/src/hello.c:5-7

    5: 
    6:    This program is free software; you can redistribute it and/or modify
    7:    it under the terms of the GNU General Public License as published by

test

2008-01-06

_ hello/2.3/src/hello.c:30-30

   30:   { "next-generation", no_argument, NULL, 'n' },

next-generation なんてオプションあったんだ。

_ coreutils/6.9/src/sort.c:2237-2242

 2237:    Use a recursive divide-and-conquer algorithm, in the style
 2238:    suggested by Knuth volume 3 (2nd edition), exercise 5.2.4-23.  Use
 2239:    the optimization suggested by exercise 5.2.4-10; this requires room
 2240:    for only 1.5*N lines, rather than the usual 2*N lines.  Knuth
 2241:    writes that this memory optimization was originally published by
 2242:    D. A. Bell, Comp J. 1 (1958), 75.  */

これってマージソートなんだっけ。あとで読む。