I think it is strange that there is no mention of either time or space complexit... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		Hendrikto on Sept 11, 2024 \| parent \| context \| favorite \| on: Possibly all the ways to get loop-finding in graph... I think it is strange that there is no mention of either time or space complexity, in an article about graph algorithms. If you don‘t need to be efficient, any problem is relatively easy to solve.

aebtebeten on Sept 11, 2024 [–]

If you're not yet correct, complexity is moot.

> When in doubt, use brute force. —KLT

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact