Back to course home
0% completed
Vote For New Content
Typo on Time Complexity for Tasks Scheduling
Saiful I
Feb 7, 2024
Hello,
if Task Scheduling is similar to Topological Sort, the time complexity should be O(V+E) but it is written as O(V+E)O(V+E) in the solution. I checked step d and the code (Java) was identical.
Thanks
0
0
Comments
Comments
On this page