![Question 1295 – Nielit STA [02-12-2018]](https://solutionsadda.in/wp-content/uploads/2019/05/green-new-logo.png){kind=logo}
Question 1294 – Nielit STA [02-12-2018]
December 10, 2023Question 1302 – Nielit STA [02-12-2018]
December 10, 2023Question 1295 – Nielit STA [02-12-2018]
In the Merge sort algorithm, the time taken by the algorithm to divide an array of size n into two equal halves and many times that divide is called in overall sorting procedure is:
Correct Answer: C
Question 45 Explanation:
→ In the Merge sort algorithm, the time taken by the algorithm to divide an array of size n into two equal halves is O(logn)
→ many times that divide is called in overall sorting procedure is O(logn)
→ many times that divide is called in overall sorting procedure is O(logn)
O(1) and θ(logn)
θ(1) and θ(logn)
O(logn) and θ(logn)
θ(logn) and O(1)
Subscribe
Login
0 Comments