This is a terrible, awful way to do it - but it works:
def alphabetize(s, delimiter=","):
values = s.split(delimiter) # convert to a list
result = []
while values:
# this is effectively select-sort - which is O(n**2) -
# but even worse because deleting a list item is also
# O(n), making it O(n**3) overall
smallest = min(range(len(values)), key=values.__getitem__)
result.append(values[smallest])
del values[smallest]
# rejoin the sorted items to a string
return delimiter.join(result)
which runs like
>>> alphabetize("Parker,Peter,Wayne,Bruce,Wilson,Wade")
'Bruce,Parker,Peter,Wade,Wayne,Wilson'