Best shuffle: Difference between revisions

characters = chars(s);

ranking = {<p, comparePcountSame(p, characters)> | p <- permutations(characters)};

best = {<s, stringChars(p), n> | <p, n> <- ranking, n == min(range(ranking))};

return takeOneFrom(best)[0];

public int comparePcountSame(list[int] permutations, list[int] characters){

return (0 | it + 1 | n <- index(characters), permutations[n] == characters[n]);