Re: [racket-users] Best alternate editor/IDE for someone who gets overwhelmed by complexity

On 2016-11-26 04:54 PM, Matthias Felleisen wrote: The documentation site includes links to PDFs. You could print — Matthias For various reasons, I prefer reading PDFs when on my tablet. So what I did was to write a kludgy shell script that mungs up a copy of the index.html file that references

Re: [racket-users] Very beginner Student who needs Help!

Just realized that your list was sorted ascending, but for some reason, I latched into 'descending'. In the text below where I said 'smaller' it should say 'bigger'. "...put a number (x) on the front of a list if (first lst) is BIGGER than x. If (first lst) is not BIGGER..." On Sun, Nov 27, 201

Re: [racket-users] Very beginner Student who needs Help!

Ben, let me recommend you work thru the beginning of Part II of HtDP/2e, especially the chapter on Designing with Self-referential Data Definitions: http://www.ccs.neu.edu/home/matthias/HtDP2e/part_two.html http://www.ccs.neu.edu/ho

Re: [racket-users] Very beginner Student who needs Help!

Ben, I'm guessing that this is homework? Unless you have an artificial constraint stopping it, I would suggest that you take a look at the docs for Racket's built-in 'sort' function. Also, 'cons'. (See the 'Pairs and Lists' documentation.) As a more general hint, Racket is a functional language

Re: [racket-users] Very beginner Student who needs Help!

The first question is: what is a list? Forget empty lists for a moment. Think about a list with a single real in it. According to your program, what does that look like? You're defining lists in terms of pairs. Okay, so let's say you want a list, where the only element in it is the number 1.0.

Re: [racket-users] Very beginner Student who needs Help!

On Sunday, November 27, 2016 at 10:16:34 PM UTC+1, Jon Zeppieri wrote: > Well, okay, first your program needs to admit the possibility of an empty > list. But once it does, see my previous message. > > > On Nov 27, 2016, at 3:45 PM, Ben Ghanem Anis wrote: > > > > Hey guys, > > I need some help

Re: [racket-users] Very beginner Student who needs Help!

Well, okay, first your program needs to admit the possibility of an empty list. But once it does, see my previous message. > On Nov 27, 2016, at 3:45 PM, Ben Ghanem Anis wrote: > > Hey guys, > I need some help .. > I need to write two procedures .. first one should be able to insert a real > n

Re: [racket-users] Very beginner Student who needs Help!

Okay, it might be more obvious how to approach the second procedure if we first consider a missing case in your first. What happens if you try to insert a real into an empty list, using your procedure? > On Nov 27, 2016, at 3:45 PM, Ben Ghanem Anis wrote: > > Hey guys, > I need some help ..

[racket-users] Very beginner Student who needs Help!

Hey guys, I need some help .. I need to write two procedures .. first one should be able to insert a real number in the right position in a list (that is by default sorted ascending) made of pairs (make-pair), also i need to use the procedure to write another one that is able to sort in an ascen

Re: [racket-users] eval:check and floating-point precision

Thanks, Pierpaolo, but wouldn't that also render as documentation? I don't want to show an example where (good-enough (t-test ...) ) is documented, I just want (t-test ...) to show up to the user. -- You received this message because you are subscribed to the Google Groups "Racket Users" group