Computer Chess Club Archives

Search

Terms

Messages

Subject: A final stab at big-O

Author: Dann Corbit

Date: 12:49:26 05/09/01

Suppose that I have a collection of sorting algorithms.

I know that the count of vector elements to be put into sorted order will never
exceed a size_t.

I have a counting sort that can sort in O(n*log(element_length))

I have a relaxed-quick-heapsort that can sort in O(log(n!))

I have an shell sort that can sort in O(n^(1 + epsilon/n))

Now, since we know that the count will never exceed a size_t, have all these
calculations really simplified to O(1)?  Is there really no way to choose
between them?  If they really do retain their original behaviors, then what is
the utility of declaring them to be O(1)?

Isn't this a bit off topic? (NT) Peter McKenzie 13:50:48 05/09/01
- Re: Isn't this a bit off topic? (NT) Dann Corbit 13:52:12 05/09/01
  - Re: Isn't this a bit off topic? (NT) Peter McKenzie 16:51:46 05/09/01
    - Re: Isn't this a bit off topic? (NT) Dann Corbit 16:53:39 05/09/01
  - Re: Isn't this a bit off topic? (NT) Dann Corbit 14:14:55 05/09/01
  - Re: Isn't this a bit off topic? Mogens Larsen 14:04:02 05/09/01
Re: A final stab at big-O Paul 13:17:37 05/09/01
- Re: A final stab at big-O Robert Hyatt 19:30:10 05/09/01
- Re: A final stab at big-O Dann Corbit 13:33:05 05/09/01
Re: A final stab at big-O Andrew Dados 13:02:59 05/09/01
- Re: A final stab at big-O Josh Strayhorn 13:15:27 05/09/01
- Re: A final stab at big-O Dann Corbit 13:12:04 05/09/01
  - Re: A final stab at big-O Andrew Dados 13:24:09 05/09/01
    - Re: A final stab at big-O Dann Corbit 13:35:00 05/09/01
- Re: A final stab at big-O Robert Hyatt 13:05:37 05/09/01
  - Re: A final stab at big-O Andrew Dados 13:10:09 05/09/01
    - Re: A final stab at big-O Robert Hyatt 19:36:56 05/09/01
    - Re: A final stab at big-O Dann Corbit 13:15:44 05/09/01
      - Re: A final stab at big-O Ricardo Gibert 14:32:27 05/09/01
        
        Re: A final stab at big-O Dann Corbit 14:40:16 05/09/01
        
        Re: A final stab at big-O Ricardo Gibert 16:27:51 05/09/01
        
        Re: A final stab at big-O Dann Corbit 16:31:23 05/09/01
        
        Re: A final stab at big-O Ricardo Gibert 16:34:35 05/09/01
        
        Re: A final stab at big-O Dann Corbit 16:36:18 05/09/01
        
        Re: A final stab at big-O Ricardo Gibert 17:14:41 05/09/01
        
        Re: A final stab at big-O José Carlos 09:00:54 05/10/01
        
        Re: A final stab at big-O Robert Hyatt 19:41:41 05/09/01
        
        Re: A final stab at big-O Dann Corbit 17:23:27 05/09/01
        
        Re: A final stab at big-O Ricardo Gibert 18:24:01 05/09/01
        
        Re: A final stab at big-O Ricardo Gibert 15:20:59 05/09/01
        
        Re: A final stab at big-O Dann Corbit 15:28:21 05/09/01
        
        Re: A final stab at big-O Ricardo Gibert 17:07:29 05/09/01
        
        Re: A final stab at big-O Dann Corbit 17:18:09 05/09/01
        
        Re: A final stab at big-O Uri Blass 15:06:36 05/09/01
        
        Re: A final stab at big-O Dann Corbit 15:09:38 05/09/01
        
        Re: A final stab at big-O Antonio Dieguez 09:08:21 05/10/01

This page took 0.01 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.