Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #16408
| Newsgroups | comp.programming |
|---|---|
| Date | 2023-02-14 04:08 -0800 |
| References | <programming-20230207203300@ram.dialup.fu-berlin.de> <trudnl$3eb3g$2@dont-email.me> |
| Message-ID | <c3bd60e6-0e34-4348-bead-11ba85c05c85n@googlegroups.com> (permalink) |
| Subject | Re: What I like about programming . . . |
| From | Y A <y0000000000000@hotmail.com> |
Alright, but what does he not like in this ? On Tuesday, February 7, 2023 at 10:53:15 PM UTC+2, Richard Heathfield wrote: > On 07/02/2023 7:53 pm, Stefan Ram wrote: > > <snip> > > > 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
Back to comp.programming | Previous | Next — Previous in thread | Find similar
Re: What I like about programming . . . Richard Heathfield <rjh@cpax.org.uk> - 2023-02-07 20:53 +0000 Re: What I like about programming . . . Y A <air000000000000@ya.ee> - 2023-02-10 03:06 -0800 Re: What I like about programming . . . Y A <y0000000000000@hotmail.com> - 2023-02-14 04:08 -0800
csiph-web