This dimension groups algorithms by their time complexity, how the time an algorithm takes grows with the size of its input. Wikipedia notes that an algorithm "terminates after a finite number of steps," and how many steps it needs is exactly what time complexity measures. Browsing by time complexity keeps algorithms of a similar efficiency grouped together.
O(|E| log |V|) with a binary heap
Filter Results1 entry
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.