From mboxrd@z Thu Jan  1 00:00:00 1970
From: dave@horsfall.org (Dave Horsfall)
Date: Sun, 31 Jan 2016 12:41:15 +1100 (EST)
Subject: [TUHS] Short history of 'grep'
In-Reply-To: <CAOkr1zUprhZws1WoD+4fuepMZkzNLO9HjNfLp1fGrDnjx4JKtA@mail.gmail.com>
References: <20160130030012.GB9762@minnie.tuhs.org>
 <56AD0AB7.40701@mhorton.net>
 <alpine.BSF.2.11.1601310639150.14724@aneurin.horsfall.org>
 <56AD1B28.4010908@mhorton.net>
 <alpine.BSF.2.11.1601310740170.14724@aneurin.horsfall.org>
 <CAOkr1zUprhZws1WoD+4fuepMZkzNLO9HjNfLp1fGrDnjx4JKtA@mail.gmail.com>
Message-ID: <alpine.BSF.2.11.1601311227470.14724@aneurin.horsfall.org>

I'm still trying to get my around about how a program such as "egrep" 
which handles complex patterns can be faster than one that doesn't...  It 
seems to defeat all logic :-)

Is there a simple explanation, involving small words?  I've never really 
looked at the theory.

-- 
Dave Horsfall DTM (VK2KFU)  "Those who don't understand security will suffer."