If it's clarity you're after, rather than speed, I think this is very clear:
def sortAndUniq(input):
output = []
for x in input:
if x not in output:
output.append(x)
output.sort()
return output
It's O(n^2) though, with the repeated use of not in for each element of the input list.