Re: File System conversion -- ideas

[Davide Libenzi <davidel@xmailserver.org>]

On Sun, 29 Jun 2003, rmoser wrote:

> >> I've beaten the O((FS_COUNT)^2) already.  And by the way, it's
> >> O((FS_COUNT)*(FS_COUNT - 1_).  There's exactly O(2*FS_COUNT)
> >> and o(2*FS_COUNT) sets of code needed total to be able to convert
> >> between any two filesystems.
> >
> >   There's no such thing as O(x*(x-1)). This is precisely O(x^2).
> >Similarly, O(2*x) is precisely the same as O(x). If you're going to
> >try to use mathematics to demonstrate your point, please at least make
> >sure that you're using it _right_.
> >
>
> Big O notation is inappropriate here because it measures time complexity;
> however, I was following Viro's lead.  We're using it to measure code
> complexity, sorry.

In which math book O() is a time thingy ?


- Davide