Rosetta Code (specific to Tracy Harms)
Of the changes I've posted to Rosetta Code, the ones listed here are relatively interesting.
J example in the Array article
Longest common subsequence
Non-continuous subsequences
Maximal subsequence
Base conversion
Create and amend
One-dimensional cellular automata
Probabilistic choice
Monte Carlo simulation
Playing cards (Ric Sherlock contributed several improvements.)
Ric Sherlock suggested two different ways to structure a deck of playing cards, synonyms to my original.
NB. Original:
|:(13|i.52),:<.13%~i.52
NB. Alternatives:
,/(i.#N0),."1 0 i.#N1
>;<"1{ (i.#N0);i.#N1
NB. where character arrays N0 and N1 spell out values and suitsThe advantage to the original is that it defines the deck independently of the textual representation. It clearly defines a deck as four groups of thirteen values each. That clarity, however, occurs only by thinking through the math. One advantage of Ric's alternatives is that they preclude mismatched lengths between the descriptions and this deck definition. It's good to compare these three ways of computing the same 52-by-2 table as each relies on a different set of primaries.