From: jameskuyper@alumni.caltech.edu   
      
   On 2025-10-24 11:22, Janis Papanagnou wrote:   
   > On 24.10.2025 16:35, Michael S wrote:   
   ...>> Actually, the number of calls in naive recursive variant = 2*FIB(N)-1.   
   >> So, O(1.618**n) - a little less bad than your suggestion.   
   >   
   > It's new to me that O-complexities would be written with decimals.   
      
   Complexities are determined by the highest power of the relevant   
   parameter; that power needn't be integral, though it usually is. I'd be   
   interested in the derivation of that result.   
      
   > You also don't say that 'insertion sort' is O((N^2)/2); it's O(N^2).   
   While you're correct, I wonder why you said that? I don't see any   
   examples of anyone saying anything like that above.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)