Acest algoritm are o complexitate de O( $N$ + $M$ ) deoarece cautarea in adancime necesita un timp O( $N$ + $M$ ) iar inserarea fiecaruia din cele {$|N|$} varfuri in capul liste simplu inlantuite necesita timp O( $1$ ).
h3. Alte probleme

"Topological Sort":http://www.algorithmist.com/index.php/UVa_10305

"Honest":http://campion.edu.ro/problems/3/237/honest_ro.htm

== include(page="template/taskfooter" task_id="sortaret") ==