Chronosort(ledoc.itch.io)
ledoc.itch.io
Chronosort
https://ledoc.itch.io/chronosort
13 comments
Why do games like this have one game a day? What's preventing them randomizing it so I can keep playing? I mean I'll be honest, it's pretty frustrating given I'll likely never visit your website ever again.
With wordle at least I think the appeal is that you can play it async with friends and discuss your outcomes. "Have you solved the wordle today?" "Yea it was a tough one!".
I used to play https://wikitrivia.tomjwatson.com/, basically the same and it allows playing nay number of games.
You answered your own question at the end there. It's to keep you coming back every day.
I thought this was going to be a silly sorting algorithm, like bogosort.
So, here's my version of chronosort: Given a set of natural numbers, place them all on a timer, with a timeout equal to the number, and callback argument also equal to the number. The callback function simply appends its argument to the end of a shared list. At some point you will have a sorted and (eventually) complete list :)
So, here's my version of chronosort: Given a set of natural numbers, place them all on a timer, with a timeout equal to the number, and callback argument also equal to the number. The callback function simply appends its argument to the end of a shared list. At some point you will have a sorted and (eventually) complete list :)
It is as silly as bogosort.
It's queue-sort. You put the elements into a priority queue, then remove them in property order and put them into a list.
Here you just use the inherent queue of a timer system, which wastes time between extracting the next element. That's silly and inefficient, and disingenuous in trying to hide the queue.
It's queue-sort. You put the elements into a priority queue, then remove them in property order and put them into a list.
Here you just use the inherent queue of a timer system, which wastes time between extracting the next element. That's silly and inefficient, and disingenuous in trying to hide the queue.
Chronosort is closer to radix sort, as both are O(n) if values are bounded. Queue-sort (aka heapsort) is O(n log n).
And with minor O(n) modifications, chronosort is fixed time too!
That's called "sleepsort".
For examples, https://hn.algolia.com/?q=sleepsort , https://stackoverflow.com/questions/6474318/what-is-the-time... , https://stackoverflow.com/questions/74917807/is-there-any-pr...
For examples, https://hn.algolia.com/?q=sleepsort , https://stackoverflow.com/questions/6474318/what-is-the-time... , https://stackoverflow.com/questions/74917807/is-there-any-pr...
Does not allow me to play with different cards after a restart.
Honestly I'm unlikely to remember about it tomorrow.
Why is it explicitly for desktop? The hardware requirements are low, and people mostly use mobile for time killer games. It needs to be mobile-first.
Honestly I'm unlikely to remember about it tomorrow.
Why is it explicitly for desktop? The hardware requirements are low, and people mostly use mobile for time killer games. It needs to be mobile-first.
Lost all lives trying to place the 10th card :(
I liked how it made me think about prerequisites for various technologies in order to guess when they were invented.
I liked how it made me think about prerequisites for various technologies in order to guess when they were invented.
Worked fine on my android.
I like the "one game a day" style, bit I also like reading Samuel Pepys diary.
I got plenty of other things to spend my time on.
I like the "one game a day" style, bit I also like reading Samuel Pepys diary.
I got plenty of other things to spend my time on.