Jump to content

Talk:Szymański's algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Joshix 204 (talk | contribs) at 20:04, 22 October 2024 (Notation choices in the pseudo code: new section). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Inconsistency in the states

[edit]

The description of the algorithm defines the states 0 - 4 with a short description. In the picture labelled "Scheme of Process States During Execution", the same states are given, but it appears that states 2 and 3 have been swapped. This inconsistency call the subsequent pseudo code into question. 84.92.58.250 (talk) 14:03, 12 September 2024 (UTC)[reply]

The order in the picture is just not in numerical order. The labels seem to be consistent. It's like in the paper https://dl.acm.org/doi/pdf/10.1145/55364.55425 Joshix 204 (talk) 19:39, 22 October 2024 (UTC)[reply]

Notation choices in the pseudo code

[edit]

It should be mentioned, that 0..N is a notation for a range with N included and that the first element of an array is at index 1. These choices could cause confusion for readers. Joshix 204 (talk) 20:04, 22 October 2024 (UTC)[reply]