def sort(array):
    """
    The most naive version of Selection Sorting algorithm.
    """

    length = len(array)

    # Traverse through all elements in array
    for i in range(len(array)):

        # Find the minimum element in remaining unsorted array
        index = i

        for j in range(i+1, len(array)):

            if array[index] > array[j]:
                index = j

        # Swap the found minimum element with the first element.
        array[i], array[index] = array[index], array[i]

    return array