Question

If this is Bubble sort then what is this?

Do you see the placement of Swap()?

Answer 1

The first list is indeed selection sort. It is in essence the same as the algorithm on the link you’ve provided. But instead of finding the element that has the minimum value, and swapping it with arr[i] once after the j loop, the first code immediately swaps arr[i] with any value it encounters which is smaller.

In both cases, at the end of the i loop, arr[i] will contain the smallest element in a within the range i+1..SIZE.

There are two differences between the two algorithms: the code you show here performs more than one swap per iteration, and it shuffles the data that is not yet sorted (this is not really important, as they will eventually get sorted). So, basically it is less efficient than the code you’ve linked.