Answered by : nutty-narwhal-36doso7eldz0

for i = 1:n, swapped = false for j = n:i+1, if a[j] < a[j-1], swap a[j,j-1] swapped = true → invariant: a[1..i] in final position exit if not swapped
end

Source : https://modules.lancaster.ac.uk/pluginfile.php/3213963/mod_label/intro/scc110-problem-set-4.html?time=1667164952710 | Last Update : Tue, 08 Nov 22