Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming > #16374 > unrolled thread

Re: What I like about programming . . .

Back to article view | Back to comp.programming

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.

Contents

  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

#16374 — Re: What I like about programming . . .

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

[toc] | [next] | [standalone]

#16396

I hate programming.



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

[toc] | [prev] | [next] | [standalone]

#16408

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

[toc] | [prev] | [standalone]

Back to top | Article view | comp.programming

csiph-web