From: rjh@cpax.org.uk   
      
   On 07/02/2023 7:53 pm, Stefan Ram wrote:   
      
      
      
   >    When things get more complicated, it becomes more difficult,   
   >    to get your opponent to admit that you are right. For example,   
   >    you cannot write a program that shows the complexity of an   
   >    algorithm in a convincing manner.   
   >   
   >    Of course, it is also possible that I am the one who is wrong.   
      
   Loop through from 1 to N.   
      
   Count c comparisons, say, on each iteration.   
      
   print n,c   
      
   You now have CSV data you can feed to Libre Office or the   
   spreadsheet program of your choice to make a nice pretty graph.   
      
   With big enough N it should show you most of what you need.   
      
   Of course, it is also possible that I am the one who is wrong.   
   But I think I just showed that not only /can/ you write such a   
   program, but it isn't even very difficult.   
      
   --   
   Richard Heathfield   
   Email: rjh at cpax dot org dot uk   
   "Usenet is a strange place" - dmr 29 July 1999   
   Sig line 4 vacant - apply within   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)