
Mailing List Archive
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [tlug] rsync efficiency (was: The Mother of All (bash) Commands)
- Date: Tue, 1 Apr 2008 10:06:53 +0200
- From: Attila Kinali <attila@example.com>
- Subject: Re: [tlug] rsync efficiency (was: The Mother of All (bash) Commands)
- References: <op.t756gdbtp3esx5@mail.gol.com> <200803171322.13584.daniel.ramaley@drake.edu> <20080317210112.T39931@isris.pair.com> <200803180822.19747.daniel.ramaley@drake.edu> <20080318155544.79e7efac.attila@kinali.ch> <20080322090456.GH5267@lucky.cynic.net> <20080331135150.aab7cce9.attila@kinali.ch> <d8fcc0800803311654i7e164418l37520bfba4d8b383@mail.gmail.com>
- Organization: SEELE
On Tue, 1 Apr 2008 08:54:46 +0900
"Josh Glover" <jmglov@example.com> wrote:
> On 31/03/2008, Attila Kinali <attila@example.com> wrote:
>
> > Of course, my example is a bit on the extreme side, but rsync
> > claims to be fast and efficient, which it definitly is not.
>
> Not to defend rsync here, but just because an algorithm has a
> pathological case does not make it inefficient, it just means that it
> has a pathological case. Which is why algorithms are rated for best,
> worst, and average case performance.
Yes, but would you call a sorting algorithm fast, if it would
perform good on random sorted data (O(n*log(n)), but take o(exp(n))
if the data is reverse ordered? Yes, it might be a pathological
case, but if this pathological case is actually quite common,
then the algorithm as a big flaw.
Attila Kinali
--
Praised are the Fountains of Shelieth, the silver harp of the waters,
But blest in my name forever this stream that stanched my thirst!
-- Deed of Morred
Home |
Main Index |
Thread Index