What would be the average performance (big O notation) of this sorting algorithm

Step 1: Chose two random elements of list

Step 2: If the first element is bigger than the second, swap them

Step 3: Repeat until sorted