CAT 2024 Last Batch ๐งโ๐ Starts on Monday (22nd July). Enroll now
Edit MetaData
The Average case and worst case complexities for Merge sort algorithm are
$$O(n^{2}),O(n^{2})$$
$$O(n^{2}),O(n \log_{2} n)$$
$$O(n \log_{2}n),O(n^{2})$$
$$O(n \log_{2}n), O(n \log_{2}n)$$
Create a FREE account and get:
Login to your Cracku account.
Follow us on
Incase of any issue contact support@cracku.in
Boost your Prep!
Quick, Easy and Effective Revision
By proceeding you agree to create your account
Free CAT Formulae PDF will be sent to your email address soon !!!