Racket is an extensible general programming language in the Lisp family.

learn more… | top users | synonyms

2
votes
1answer
26 views

Tridiagonal Lists in Scheme

...
4
votes
4answers
106 views

Project Euler 1 (sum of multiples of 3 or 5 under 1000)

I solved this a while ago. In the moment I solved it I was learning Scheme and, well, I still am. I'm not looking at the best solution (I searched for it and coded it already, in Python), what I want ...
1
vote
1answer
62 views

Simplifying Dr.Racket drawing code

I am using Dr.Racket, Intermediate Student with Lambda. I was wondering if there was any way I can simplify this code using any sort of method like lambda, abstraction, map, filter, etc. ...
0
votes
0answers
34 views

Is there any way of making these drawing functions shorter or not as repetitive?

I am using Dr.Racket, Intermediate Student with Lambda. I was wondering if there was any way I can simplify this code using any sort of method like lambda, abstraction, map, filter, etc. Any input ...
3
votes
1answer
46 views

Simplifying Dr.Racket alien code

I am using Dr.Racket, Intermediate Student with Lambda. I was wondering if there was any way I can simplify this code using any sort of method like lambda, abstraction, map, filter, etc. ...
0
votes
0answers
28 views

Is there any way I can simplify these drawing functions? [duplicate]

I am using racket language with Intermediate Student with lambda. I was just wondering if there was any way I can simplify this code using lambda, map, filter, or abstraction. Any input would be ...
3
votes
2answers
220 views

Why is this RC4 code in Racket so slow?

According to shootout.alioth.debian.org, Racket is not much slower than C#, at least in the same order of magnitude due to its JIT compiler. However, I'm seeing at least two degrees of magnitude ...
0
votes
0answers
68 views

Creating an updating hash table

I'm not sure if this implementation is good enough. The function takes a vector of 1 million chars and creates a table of the sequences that pass before the next occurrence of itself. Some questions ...
4
votes
0answers
101 views

Quick Insert Merge Sort

I have written this code to sort a list of numbers, in increasing order. It is a combination of quick sort, insertion sort, and merge sort. I make the first element of the list a pivot, then I go ...
3
votes
1answer
230 views

Scheme/Racket: idiomatic infix math evaluator

Inspired by xkcd and a couple of praising blog posts, I decided to try out Lisp. It seemed that the best-supported dialect was Racket, itself a variant of Scheme, so I went with that and wrote an ...
5
votes
1answer
267 views

Improving a priority queue sketch in Racket/Scheme

I just put together the skeletons for a priority queue using a binary heap in racket/scheme. Using racket/scheme is all about the educational experience and I was wondering if anyone wants to ...
3
votes
1answer
189 views

A Simple Unix Filter in Racket - Learning the Racket Way

I've written the following simple filter in Racket as my first Racket program and am wondering if I am writing it in an "idiomatic Racket style". ...
2
votes
0answers
415 views

Insert-everywhere

This is HTDP Excercise 12.4.2 :- Page 161 Develop a function insert-everywhere. It consumes a symbol and a list of words. The result is a list of words like its second argument, but with the ...