Announcing the MiniScript Rosetta Code Contest!

SynapticBytes

Ahh OK, will go revise

I've updated the obvious ones. I'll try and check back in the earlier ones to see if I've made any newbie mistakes as well.

Here's some more for the list : -

Magic 8 Ball http://rosettacode.org/wiki/Magic_8-Ball
Vector http://rosettacode.org/wiki/Vector
Reverse words in a string http://rosettacode.org/wiki/Reverse_words_in_a_string
Pangram Checker http://rosettacode.org/wiki/Pangram_checker

AsterAether

Whew, well then
Thats alot
Anyway, got some more:

AsterAether

And one more:

http://rosettacode.org/wiki/Fibonacci_sequence#MiniScript

SynapticBytes

A quick one before work

Palindrome detection http://rosettacode.org/wiki/Palindrome_detection

AsterAether

http://rosettacode.org/wiki/Classes#MiniScript

SynapticBytes

Continuing

Temperature conversion http://rosettacode.org/wiki/Temperature_conversion
Subleq (Wow this one was a headache to debug) http://rosettacode.org/wiki/Subleq
Show ASCII Table http://rosettacode.org/wiki/Show_Ascii_table

Also, I updated the http://rosettacode.org/wiki/Reverse_a_string#MiniScript page, to tidy the script a little, plus I put it after MIPS oops

jstrout

Wow! That Subleq task does look like a pain. Really cool though, and not implemented by that many other languages. Even though you've done 29 tasks, no one can say you've picked all easy ones!

As for the Reverse a String task, I was looking at that last night, and wondering whether there was some easier way to do it. But I think today's version is about as short and clear as it can be. I have occasionally been tempted to add a .reverse method (that would apply to strings and lists), but it just doesn't make the "keeping it Mini" cut — in real (not demoing-the-language) code, the need to reverse a sequence is fairly rare, and it's not hard to write it yourself if you need it.

SynapticBytes

One final one, to make a nice even 30. I even tried to go a bit fancy by using recursion.

Binary Digits http://rosettacode.org/wiki/Binary_digits

EDIT
Curiosity got the better of me, so here's another. It's a rather cool result. Not sure if the main for loop could be tidier on this one or not. Word of warning, don't try and run the program with a top range of 50! You have been warned....

Look-and-say sequence http://rosettacode.org/wiki/Look-and-say_sequence#MiniScript

jstrout

SynapticBytes

I even tried to go a bit fancy by using recursion.
Binary Digits http://rosettacode.org/wiki/Binary_digits

That's a fun one. Though I probably would have gone with a simpler approach like this.

Still, seeing different ways of solving the problem is part of the fun. After the contest is over I'll review all the entries, and start a separate discussion in cases like this one where there may be more than one interesting approach.

jstrout

Well, today's the last day of the contest! You have until midnight tonight (Pacific time) to get in any additional entries if you like.

Tomorrow I'll tally up the results, and announce the winners! Great job, everyone!

SynapticBytes

Yeah that’s a lot cleaner. When I originally started, I imagined a much cleaner recursion solution, but had issues because I needed to recurse both up and down the heirarchy of digits, and was getting stuck in loops. So as often happens when trying to patch multiple issues one at a time, the complexity increases.

SynapticBytes

So, cribbing from your code, this is what I originally had in mind, but got lost along the way, just 0 is an edge case.

Edge case version

I've updated the Rosetta code to this version

SynapticBytes

Another to warm the brain up for the day ahead

Count occurrences of a string

jstrout

SynapticBytes Re that "Count occurrences of a string," did you consider using split?

SynapticBytes

I looked at it, but doesn’t it give you the cut up string without the delimiter? Are you saying if I use the search term as the delimiter, it would return something meaningful?

jstrout

Yes. It would return a list whose length is the number of occurrences of the search string plus one.

SynapticBytes

So they would just be empty elements if the string being searched consisted entirely of substrings?

edit

Tried it, yes it does. So that makes it trivial code, but somehow it just seems wrong as a solution, creating a dummy list just to get a count? Can’t argue with how easy it is though.

edit #2

After a little more testing, you win. I ran a performance test with the split command vs my original version, with a 1 million character string of the letter "a", searching for "a". My version took 14.047 seconds, yours took 0.234 seconds 🤣 Not sure on the memory usage differences between those two though...

I'll change it on Rosetta when I get home tonight.

edit #3
done

jstrout

And that's a wrap! It looks like the final top-3 finishers are:

1st Place: @SynapticBytes with 32 tasks
2nd Place: @AsterAether with 11 tasks
3rd Place: @mrphilipjoel with 3 tasks

And honorable mentions to @JTK and @WorldLover for getting things started. Congratulations to all!

Top-3 finishers, please PM me your email address where you'd like to receive the Amazon.com gift certificate (or if that doesn't work for you, then let's start a discussion about what other prize I could send instead). Just hover over my name above, then click the little three-dots icon, and choose "Send a Message".

SynapticBytes

Thanks for running the competition. It was a great way to get up to speed on MiniScript.

As for the PM, I’ve been trying to figure that one out for a few days. I didn’t think they were possible, since I do most of my forum reading on my iPad, and hover isn’t an iPad option. Will message when I’m on a PC.

« Previous Page