#Time Complexity:
<ul>
	<li>Best Case: Ω(n^2)</li>
	<li>Worst Case: O(n^2)</li>
	<li>Average Case: Θ(n^2)</li>
</ul>

#Space Complexity:
<ul>
	<li>Worst Case: O(n) auxiliary</li>
</ul>

<strong>Rank Sort</strong> is a very simple algorithm which is <i>costly in terms of memory</i>as compared to other sorting algorithm. But there are no swaps in the O(n^2) part. Thus this can also be effective over Insertion and Bubble Sort on a machine with costly swaps.