# your code goes here
# your code goes here
def insertion_sort(my_list):
for i in range(len(my_list)):
key = my_list[i]
min=0
j=i+1
for k in range(j,len(my_list)):
if key > my_list[k]:
min = k
swap=my_list[i]
my_list[i]=my_list[min]
my_list[min]=swap
some_list = [11,3,6,4,12,1,2]
insertion_sort(some_list)
print(some_list)
IyB5b3VyIGNvZGUgZ29lcyBoZXJlCgojIHlvdXIgY29kZSBnb2VzIGhlcmUKCmRlZiBpbnNlcnRpb25fc29ydChteV9saXN0KToKCWZvciBpIGluIHJhbmdlKGxlbihteV9saXN0KSk6CgkJa2V5ID0gbXlfbGlzdFtpXQoJCW1pbj0wCgkJaj1pKzEKCQlmb3IgayBpbiByYW5nZShqLGxlbihteV9saXN0KSk6CgkJCWlmIGtleSA+IG15X2xpc3Rba106CgkJCQltaW4gPSBrCglzd2FwPW15X2xpc3RbaV0KCW15X2xpc3RbaV09bXlfbGlzdFttaW5dCglteV9saXN0W21pbl09c3dhcAoJCiAKc29tZV9saXN0ID0gWzExLDMsNiw0LDEyLDEsMl0KaW5zZXJ0aW9uX3NvcnQoc29tZV9saXN0KQpwcmludChzb21lX2xpc3Qp