Largest and smallest values from concatenated integers
CJam, 14 13 bytes
qS/e!:s$(N@W=
Pretty straight forward. This is how it works:
qS/ e# Split the input on spaces
e! e# Get all permutations of the input numbers
:s e# Join each permutation order into a single string
$ e# Sort them. This sorts the strings based on each digit's value
(N@W= e# Choose the first and the last out of the array separated by '\n'
Try it online here
Pyth, 14 13 bytes
hJSmsd.pcz)eJ
Generates all permutations and sorts them, printing the first and last element.
Python 2, 104 99 bytes
Yep.
from itertools import*;z=[''.join(x)for x in permutations(raw_input().split())];print min(z),max(z)
Edit: thanks to xnor for -5 bytes!