11TH•Computer Science•Algorithms And Problem Solving•Question 8

a

Time complexity of Depth-First Search (DFS) in a graph is:

timer1 min read•format_list_bulletedConcept 1 of 2•forumLesson Discussion

$O(n \log n)$

forum

menu_bookLesson...

Start discussion

keyboard_arrow_down

Discuss theoretical concepts, mathematical formulas, and architectural foundations.

No comments yet. Be the first to start the discussion!