In my opinion you get it right.
First row: in the second picture, we can see that the lower part are sorted and almost every element has been moved, which we can assume that is a bubble algorithm that moves the lower values to bottom.
Second row: we can observe that along the four pictures the algorithm is starting to sort the left part of the data. This indicate that the algorithm is exploring the data from left to right and insert each explored element in right position on the explored data (insertion sort).
Third row: from the second picture, the algorithm is searching for the lowest value and sort it ( selection sort)