From: rjh@cpax.org.uk   
      
   On 07/02/2023 9:58 pm, JJ wrote:   
   > On 7 Feb 2023 19:53:17 GMT, 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.   
   >   
   > It may actually be the opposite. The program which is needed to convince the   
   > opponent, would need to be done at a lower level - which increases the   
   > complexity to understand the code.   
   >   
   > Short question or small problem usually need a long answer or complex   
   > solution. While long question or complex problem, usually need a short   
   > answer or simple solution.   
      
   It is not immediately obvious that you know what Stefan means by   
   "complexity of an algorithm".   
      
   See Knuth's "The Art of Computer Programming", Vol I, section   
   1.2.11.1 for the beginning of an introduction to "big-O"   
   notation, or failing Knuth you could start here:   
      
   https://en.wikipedia.org/wiki/Big_O_notation   
      
      
      
   --   
   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)