Sorting - General Questions

Which sorting algorithm is not comparison-based?

Which sort is used by Python's sorted() and Java's object sorting?

Which sorting algorithm has the best worst-case time complexity among these?

Which sorting algorithm divides the array into halves, sorts them and merges?

What is the output of the following code?

a = [64, 25, 12, 22, 11]
for i in range(len(a)):
    j = a.index(min(a[i:]), i)
    a[i], a[j] = a[j], a[i]
    if i == 1:
        break
print(a)