Question 11495 – APPSC-2012-DL CA
March 27, 2024Question 11497 – APPSC-2012-DL CA
March 27, 2024Question 11496 – APPSC-2012-DL CA
Time complexity of Merge sort is
Correct Answer: D
Question 26 Explanation:
Time complexity of merge sort is O(nlogn).
O(n)
O(n2)
O(log n)
O(n log n)
Subscribe
Login
0 Comments