Sorting strings by binary strings with arbitrary length

Question

i googled around and talk a lot about sorting radix in a binary string, but are they all the same length, like aobut binary string with arbitrary length?

Say I have {"001", "10101", "011010", "10", "111"}, how can I sort them? Thank!

Answer 1

Find the maximum length and overlay them on this length. Should still perform well when there is an upper bound on the length of the longest string.

Answer 2

, , , 5 2. , , , . , , , , .

, , - ( → ). , nlogn . radix O (nk) , n - , k - . k, O (nk) O (nlogn) .

Answer 3

, .

Compare that the line length will be without leading 0 (i.e. find firstIndexOf("1")); longer line is longer.
If both are the same length, just keep comparing them by character until you find two characters that are different - the line with "1" is larger.