Vidyalelo
Data Structure · Q1082

Miscellaneous on Data Structures

Programming · Data Structure · question 1082

Q1082

Time complexity to find the solution of activity selection problem takes O(n log n) time, when the list is not sorted.

A.
True
Answer
B.
False

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board