Yet another sorting algorithm
Computer Science Level pending1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 

The tight asymptotic bound of (\(\Theta\)  notation) of the sorting algorithm above(sort(A)
) can be expressed as \(\Theta(n^{\alpha})\)( \(\alpha \in \mathbb{R} \) ). Find \(\alpha\).
Details and Assumptions
 \(n\) is the size of the array to be sorted.
Your answer seems reasonable.
Find out if you're right!
Sign up to access problem solutions.
That seems reasonable.
Find out if you're right!
Already have an account? Log in here.