What algorithm is this?

Question

I can not understand this particular algorithm. It seems to be bubblesort, but not in the traditional sense. What is it?

public static void main(String[] args) 
{
    double[] a = {0.75, 0.5, 1.0};                          
    sort(a);

    for (int i = 0; i < a.length; i++)
        System.out.println(a[i]);
}

public static void sort(double[] tal)
{
    double p = 0;
    int k = 0;

    for (int i = 0; i < tal.length - 1; i++)
    {
        k = i;
        for (int j = i + 1; j < tal.length; j++)
        {
            if (tal[j] < tal[k])
                k = j;
        }

        p = tal[i];
        tal[i] = tal[k];
        tal[k] = p;
    }
}

Answer 1

At first, I thought incorrectly that this was Insertion sort . This is a sorting selection (from a Wikipedia entry)

Answer 2

This is a sort of selection. The inner loop finds the smallest among the remaining elements, which then exchanges with the first element in the unsorted range.

Answer 3

. for while.