Jump to content

Talk:YDS algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Macoroni (talk | contribs) at 23:37, 1 December 2017. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Recursive?

Wondering why the article refers to the algorithm as "recursive"? It seems to me, from the overview, that it's an iterative algorithm (i.e. perform these steps, then continue performing these steps until finish). Anyone agree/disagree?

Complexity

The time complexity of this should probably be included in the article. However, I'm not sure what the complexity is. Naively, this algorithm can be performed in O(n^3). According to the referenced paper, the citation states that the algorithm can be performed in O(n^2 logn), but from looking at the paper that includes that result, it seems like the O(n^2 logn) result is not for YDS, but a different algorithm that solves the problem.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:YDS_algorithm&oldid=813131392"