You are not logged in. Login Now
 0-10   10-22         
 
Author Message
13 new of 22 responses total.
aruba
response 10 of 22: Mark Unseen   Apr 27 19:01 UTC 1999

A linear algorithm would be O(n).  O(f) (pronounced "Big Oh of f") is the
"order" of a function f.  In general the definition says that

    f is O(g) if there are constants A and B such that
    A|g(n)| <= |f(n)| <= B|g(n)| for all but finitely many values of n.
    (|x| is the absolute value of x.)

So for instance, a bubble sort makes n(n-1) comparisons and some lesser number
S(n) of swaps in the process of sorting n items.  So the time it takes to run
is
    f(n) = cn(n-1) + sS(n)
where c is the time it takes to do a comparison and s is the time it takes
to do a swap.  Since
    (c/2)n^2 <= f(n) <= (c+s)n^2
for all but finitely many n, f is O(n^2).  So you can say that a bubble
sort runs in O(n^2) time.
remmers
response 11 of 22: Mark Unseen   Apr 27 21:05 UTC 1999

Okay folks, stop horsing around with mathematical generalities and
figure out my numbering system!

Also, nobody has addressed lilmo's question about woodlas.

Getting back to business, here - at the 11th hour - is the final agenda:

        GREX BOARD OF DIRECTORS MEETING

        DATE AND TIME:  Tuesday, April 27, 6:30-9:00 pm

        PLACE:          Upstairs at Zingerman's Next Door
                        422 Detroit Street, Ann Arbor

        AGENDA:

        231      Gavel Banging - remmers                 throughout
        23       Chairman's Report - remmers             10 minutes
        606      Treasurer's Report - aruba              15 minutes
        15764    Publicity Committee - mta               10 minutes
        409872   Technical Committee - staff             20 minutes
        15777    Credit Card info - dang                 20 minutes
        619      Inventory of our stuff - aruba          10 minutes
        16102    Future Planning - all                   20 minutes
        418660   New Business - all                      ?? minutes
        10885168 Gavel Cessation - remmers                0 minutes
lilmo
response 12 of 22: Mark Unseen   Apr 27 22:25 UTC 1999

Re resp:8 - Sorry, I'm reading this on a library Mac, and in the font it
chose, I can't tell the difference between O and 0, unless they are right next
to each other (and then barely).
mdw
response 13 of 22: Mark Unseen   Apr 28 08:44 UTC 1999

0 times anything is 0.  I think an O(0) function would be saying "it
takes no time at all", or at least I think that's the most sensible
interpretation.

15779
621
16154
420012
remmers
response 14 of 22: Mark Unseen   Apr 28 13:25 UTC 1999

(By Jiminny - Marcus appears to have figured it out!)
remmers
response 15 of 22: Mark Unseen   Apr 30 01:23 UTC 1999

(The mint-condition woodla has been delivered to Marcus...)
lilmo
response 16 of 22: Mark Unseen   Apr 30 21:34 UTC 1999

What's a woodla ?!??
keesan
response 17 of 22: Mark Unseen   May 4 19:37 UTC 1999

Why are my zeros now showing up as a capital O with a diagonal slash through
them whereas a while ago they were an O with a dot in the middle?  Same
hardware at my end, same Procomm settings.  (I think).
pfv
response 18 of 22: Mark Unseen   May 4 20:05 UTC 1999

differnet - and better - font. DEAL WITH IT.

remmers
response 19 of 22: Mark Unseen   May 5 12:44 UTC 1999

*Something* must have changed at your end.
ryan
response 20 of 22: Mark Unseen   May 5 13:14 UTC 1999

This response has been erased.

keesan
response 21 of 22: Mark Unseen   May 10 21:22 UTC 1999

I think I must have changed computers - the VGA monitors have the little dot
in the O and the TTL I am now using has a slash instead.  I have also noticed
that the m is different with a Graphics Plus instead of straight Hercules
card in this same computer running the same TTL monitor.
dang
response 22 of 22: Mark Unseen   May 10 23:31 UTC 1999

The basic font, as used in DOS, is stored in the ROMs of the graphics card. Thus, changing graphics cards would change that font.
 0-10   10-22         
Response Not Possible: You are Not Logged In
 

- Backtalk version 1.3.30 - Copyright 1996-2006, Jan Wolter and Steve Weiss