if you have same summ of sentences, need to sort by default input index

quote from Johan's solution:

fscking unstable native sort .. :/

Marking issue as resolved.

Can you mark this as ready or give me some suggestions on how to clarify? Capitalization is a non-issue in this kata. You're supposed to work off only the characters provided in the alphabet and not any variation of them. Character variants aren't usually a part of an encryption algorithm (though they are quite frequently in Steganography).

If I were to enforce that capital letters be transformed, I would also enforce that final forms for Hebrew and Greek characters be transformed properly in those test cases when they end up being the last letter of a word.

Cipher algorithms should never concern themselves with variants of characters unless the variant is significant to decoding characteristics. Handling character-variant cases is not part of an encryption algorithm. If I were to implement this (and I've thought about doing this for a kata), I would implement an input normalization function to transform strings to the proper variants in the provided alphabet, and an output normalization function to handle capitalization, final forms, medial forms, initial forms, isolated forms, and all of those other different character variations that exist throughout the world... maybe even diacritical marks (which I don't even know if it's possible without making decryption easier).

The change I made specifies that the test is using a lowercase Latin alphabet, which I hope provides you with enough information to understand that test case. If you believe that resolves the issue, could you mark the kata as ready? If not can you please elaborate how I could further clarify?

I made some clarification in the test case description.