I've developed a new, super cool sorting algorithm. Here's the procedure:

Until sorted:

1. Randomly generate i = some number between 0 and n - 1 (n = size of array)
2. Randomly generate j = some number between i + 1 and n - 1
3. if array[i] > array[j], swap
4. Check to see if the array has been sorted

List the algorithm's efficiency using Big-O.