From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on ip-172-31-74-118.ec2.internal X-Spam-Level: * X-Spam-Status: No, score=1.5 required=3.0 tests=BAYES_50,FREEMAIL_FROM, FROM_STARTS_WITH_NUMS autolearn=no autolearn_force=no version=3.4.5-pre1 X-Received: by 2002:ac8:e0d:: with SMTP id a13mr8162473qti.16.1612612314748; Sat, 06 Feb 2021 03:51:54 -0800 (PST) X-Received: by 2002:a25:73d6:: with SMTP id o205mr12924888ybc.253.1612612314598; Sat, 06 Feb 2021 03:51:54 -0800 (PST) Path: eternal-september.org!reader02.eternal-september.org!news.uzoreto.com!news.muarf.org!nntpfeed.proxad.net!proxad.net!feeder1-2.proxad.net!209.85.160.216.MISMATCH!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Sat, 6 Feb 2021 03:51:54 -0800 (PST) In-Reply-To: <92ef81c7-65d8-411f-97c7-7bfcc27213e1n@googlegroups.com> Complaints-To: groups-abuse@google.com Injection-Info: google-groups.googlegroups.com; posting-host=85.240.146.108; posting-account=rhqvKAoAAABpikMmPHJSZh4400BboHwT NNTP-Posting-Host: 85.240.146.108 References: <92ef81c7-65d8-411f-97c7-7bfcc27213e1n@googlegroups.com> User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: <3401b745-e012-485a-905d-1389189d6ec6n@googlegroups.com> Subject: Re: questions on input/output From: Mehdi Saada <00120260a@gmail.com> Injection-Date: Sat, 06 Feb 2021 11:51:54 +0000 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Xref: reader02.eternal-september.org comp.lang.ada:61299 List-Id: Okay here's what I've got, excluding, the RM, Barne's, and another book on = high-risk/ultra-advanced Ada that I uselessly bought but feel no remorse be= cause I'm a fetishist. Concrete Mathematics Daniel J. Velleman-How to prove it_ a structured approach Introduction to Algorithms Third Edition.pdf John_W._McCormick,_Frank_Singhoff,_J=C3=A9r=C3=B4me_Hugue(b-ok.xyz).pdf the-science-of-programming-gries Programming and Problem Solving with Ada 95, Second Edition.pdf The_Art_of_Computer_Programming - Vol 1.pdf the Craft of Programming, Reynolds.pdf thinkcomplexity.pdf Proving things should come at last. I'm not averse to math but the difficul= ty isn't absent and I fear losing motivation if I stumble again like before= ... So my confidence isn't that high. Well, just give your opinion regardle= ss. I want to get sound programming reasoning and understand algos of other= s, enough to implement them. I don't mind spending hours if it's step by st= ep and high reward... so no unnecessary gimmicks. More theoretical/philosop= hical stuff, why not, eventually in parallel, if it's enjoyable. Tell which= ones and which order.