Largest int from concatenated ints: Difference between revisions
Content added Content deleted
(→{{header|Python}}: Compare repeated string method) |
(Add refs and new solution method) |
||
| Line 8: | Line 8: | ||
Note: A solution could be to try all combinations and return the best. Another way to solve this is to note that in the best arrangement, for any two adjacent original integers X and Y, the concatenation X followed by Y will be numerically greater than or equal to the concatenation Y followed by X. |
Note: A solution could be to try all combinations and return the best. Another way to solve this is to note that in the best arrangement, for any two adjacent original integers X and Y, the concatenation X followed by Y will be numerically greater than or equal to the concatenation Y followed by X. |
||
Note: Yet another way to solve this is to pad ints to the same size by repeating the digits then sort using these repeated ints as a sort key. |
|||
Cf: |
|||
* [http://www.quora.com/Algorithms/What-is-the-most-efficient-way-to-arrange-the-given-numbers-to-form-the-biggest-number Algorithms: What is the most efficient way to arrange the given numbers to form the biggest number?]. |
|||
* [http://stackoverflow.com/questions/14532105/constructing-the-largest-number-possible-by-rearranging-a-list/14539943#14539943 Constructing the largest number possible by rearranging a list] |
|||
=={{header|Perl 6}}== |
=={{header|Perl 6}}== |
||