Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: Michael S <already5chosen@yahoo.com>
Newsgroups: comp.lang.c
Subject: Re: Suggested method for returning a string from a C program?
Date: Wed, 19 Mar 2025 12:36:47 +0200
Organization: A noiseless patient Spider
Lines: 18
Message-ID: <20250319123647.000035ed@yahoo.com>
References: <vrd77d$3nvtf$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Injection-Date: Wed, 19 Mar 2025 11:36:48 +0100 (CET)
Injection-Info: dont-email.me; posting-host="53b605ccedb1da03e7216ffdd1a8dc82";
	logging-data="625406"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/71miOcEBL7h8+Q6Sln2aDvXpHQPwFwPg="
Cancel-Lock: sha1:5k3bq9mbnqG8goN6WDvYpJm2aGU=
X-Newsreader: Claws Mail 3.19.1 (GTK+ 2.24.33; x86_64-w64-mingw32)
Bytes: 1555

On Tue, 18 Mar 2025 21:38:55 -0400
DFS <nospam@dfs.com> wrote:

> I'm doing these algorithm problems at
> https://cses.fi/problemset/list/
> 
> For instance: Weird Algorithm
> https://cses.fi/problemset/task/1068
> 

It is not an interesting programming exercise. But it looks to me as a
challenging math exercise. I mean, how could we give a not too
pessimistic estimate for upper bound of length of the sequence that
starts at given n without running a full sequence? Or estimate for
maximal value in the sequence?
So far, I found no answers.