Talk:Shapiro–Senapathy algorithm

	This article is within the scope of WikiProject Molecular Biology, a collaborative effort to improve the coverage of molecular biology 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.Molecular BiologyWikipedia:WikiProject Molecular BiologyTemplate:WikiProject Molecular BiologyMolecular Biology
???	This article has not yet received a rating on the project's importance scale.
	This article is supported by the Genetics task force (assessed as Low-importance).
	This article is supported by the Computational Biology task force (assessed as Low-importance).

Medicine Low‑importance

	Medicine portal This article is within the scope of WikiProject Medicine, which recommends that medicine-related articles follow the Manual of Style for medicine-related articles and that biomedical information in any article use high-quality medical sources. Please visit the project page for details or ask questions at Wikipedia talk:WikiProject Medicine.MedicineWikipedia:WikiProject MedicineTemplate:WikiProject Medicinemedicine
Low	This article has been rated as Low-importance on the project's importance scale.

But how does it work?

The article describes the purpose of the S&S algorithm, but tells us nothing about how it works. It's as if the Euclidean algorithm article said "the Euclidean algorithm is an efficient method for computing the greatest common divisor of two numbers", and explained how useful it is to be able to calculate greatest common divisors, but said nothing about how it works. Can this be remedied? Maproom (talk) 12:45, 2 November 2018 (UTC)[reply]