Jump to content

Talk:Hoshen–Kopelman algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 91.135.53.211 (talk) at 12:32, 19 May 2024 (Row major or column major: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Bug in pseudo-code

If we implement the pseudo-code as is it does not work. The loops on x and y start at 0, but there are indexes in arrays with value x-1 and y-1, which would raise an error. Hugo.cavalcante (talk) 19:32, 24 February 2023 (UTC)[reply]

Row major or column major

It should be noted that the pseudocode, as it is written, is very inefficient in row-major languages.

The way it is written is efficient in column-major languages.

It is inefficient in C, C++, Pascal, and several other languages.

It is effective in Fortran, MATLAB, Julia, and several other languages. 91.135.53.211 (talk) 12:32, 19 May 2024 (UTC)[reply]