===============Time complexity=============== Best case: Θ(1) Avg. case = Θ(n² log n) ∨ (n² log n) ≲ T(n) ≲ (n^2.15) Wrost case: Θ(∞) ================How it works================ It works by picking 2 random elements and swapping them if they are not in the same order
