def wstaw(t, x):
if x <= t[0]:
t.insert(0, x)
return t
if x >= t[len(t) - 1]:
t.insert(len(t), x)
return t
for i in range(len(t) - 1):
if x >= t[i] and x < t[i + 1]:
t.insert(i + 1, x)
return t
def sort(t):
pom = t[0]
for i in range(1, len(t)):
wstaw(pom, t[i])
return pom
print(sorted([34, 8, 23,12,5]))
ZGVmIHdzdGF3KHQsIHgpOgoJaWYgeCA8PSB0WzBdOgoJCXQuaW5zZXJ0KDAsIHgpCgkJcmV0dXJuIHQKCWlmIHggPj0gdFtsZW4odCkgLSAxXToKCQl0Lmluc2VydChsZW4odCksIHgpCgkJcmV0dXJuIHQKCWZvciBpIGluIHJhbmdlKGxlbih0KSAtIDEpOgoJCWlmIHggPj0gdFtpXSBhbmQgeCA8IHRbaSArIDFdOgoJCQl0Lmluc2VydChpICsgMSwgeCkKCQkJcmV0dXJuIHQKCQkJCgkJZGVmIHNvcnQodCk6CgkJCXBvbSA9IHRbMF0KCQkJZm9yIGkgaW4gcmFuZ2UoMSwgbGVuKHQpKToKCQkJCXdzdGF3KHBvbSwgdFtpXSkKCQkJcmV0dXJuIHBvbQoJCQkKcHJpbnQoc29ydGVkKFszNCwgOCwgMjMsMTIsNV0pKQ==