New XKCD Forums

swine

Yes, you were the only one who didn't forget. ;) 2023-03-07 Edit to add: response to updated comments in previous post. You are right that your heapsort, shellsort and smooth heapsort only take constant additional memory intrinsically. However, in the original challenge rules, I stated that I would ...

Opening post of round 1 here . The deadline for round 1 has passed and the results are in! Below, all passing solutions by order of submission date. Since all solutions were in Python, I decided to just do the performance measurements in Python, which is also the language in which I wrote the verif...

Spoiler (Show/Hide)

I thought my mom had a green house, but she doesn't have a green house. Why did I think she had a green house?

100%! If the next player also gets a perfect copy, maybe start a new text and update the limits in the rules?

badst

Signal

I thought I was going to nail this, but then I realized I had already forgotten the last part.

Spoiler (Show/Hide)

When I saw my mom had a greenhouse, I was confused. I thought she had a green house! Now I know that she had a greenhouse.

Sleepy

Toggle

The whispering game but in writing. Open the spoiler from the previous post, read the contents once, close again immediately. Type out the text from memory, trying hard to include all details. If you made a perfect copy, you may start a new text with at least 25 words. If you produced less than 20 w...

Mr. Bean

Happy new year!

Text:

Spoiler (Show/Hide)

A caterpillar greets an unseen third person.

scribble

Pizza

jelly

Fantasy

wonder

In principle, arrays of pretty much anything could be sorted, for example also: class instances (a.k.a. objects), possibly by a single (derived) property/attribute arrays/vectors/lists (so I mean sorting an array of arrays) hashes/maps/tables/dictionaries (possibly only by a subset of keys) complex ...

Cat

saxophone

(no idea why that one specifically)

water

load

leaf

I wrote the following in the challenge post of round 1 (emphasis added here): In each of the following categories, a ⭐️ is awarded to the solution with the best asymptotic complexity. (...) (...) Total number of copies/moves. (...) For fairer comparison with Haskell and similarly immutable programmi...

Christmas