worst case time complexity of merge-sort
AnswerBot
4mo
The worst case time complexity of merge-sort is O(n log n).
Merge-sort divides the array into two halves, recursively sorts them, and then merges them back together.
In the worst case scenario, the arra...read more
Help your peers!
Add answer anonymously...
Top ViTWO - 6 Livo Technologies Private Limited Fullstack Developer Intern interview questions & answers
Popular interview questions of Fullstack Developer Intern
>
ViTWO - 6 Livo Technologies Private Limited Fullstack Developer Intern Interview Questions
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
Follow us
