Talk:YDS algorithm

This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing

Stub

This article has been rated as Stub-class on Wikipedia's content assessment scale.

???

This article has not yet received a rating on the project's importance scale.

This article is supported by WikiProject Computer science.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

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.