Talk:Bareiss algorithm

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computing 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 ??? This article has not yet received a rating on the project's importance scale.

The linked article in PDF seems to be a scan of the original article in print. Unfortunately, the flow chart describing the algorithm (Fig. 1, pag. 569) is quite difficult to read. I created a SVG copy (also based from another scan of the article), is it OK to add it to the Wikipedia article? — Preceding unsigned comment added by 213.203.132.119 (talk) 21:09, 2 May 2018 (UTC)Reply

The original article is copyrighted. Per WP:COPYVIO, it is thus strictly forbidden to include it, or a significant part of it, in any Wikipedia article. D.Lazard (talk) 08:39, 3 May 2018 (UTC)Reply

Thanks. I found another article from Erwin H. Bareiss from two years before, where the picture of the algorithm is scanned very clearly, I'll link it in the notes. 213.203.132.119 (talk) —Preceding undated comment added 20:45, 3 May 2018 (UTC)Reply

I stopped by to learn about the Bareiss algorithm. I'm glad there's a demonstration of the algorithm. I find this particular code (pseudocode?) difficult to read. Particularly, I can't tell whether the unordered-list-item markers mean anything because the symbols aren't consistent. Also, I can't tell whether the array indexing is from zero or from one, especially due to the vague language for the special variable.

Perhaps we should seek a more clearcut example? Agfwiki (talk) 16:51, 4 June 2026 (UTC)Reply

The fact that the loop indices run from 1 to n implies that rows and columns are labeled from 1 to n. I do not know where you find inconsistent symbols and "ordered-list-item markers": i, j, k are integers, ⁠${\displaystyle M_{i,j}}$⁠ denotes always a matrix entry, except for ⁠${\displaystyle M_{0,0}}$⁠, which is an auxiliary variable; there is nothing else in the pseudocode. Nevertheless, the wording could certainly be improved. In particular, It must b be clearer that the divisions are all exact, and that, if the initial entries are integers, all entries remain integers during the execution of the algorithm.

If you do not understand the pseudo-code, the best is that you choose a random 3x4 or 4x4 matrix of integers, and you execute the pseudocode with paper and pencil. D.Lazard (talk) 17:42, 4 June 2026 (UTC)Reply

I agree about the wording and the integer thing. My confusion with the indices is from the presentation of the special variable as M[0,0]. What I mean by "unordered list item" is bullet point formatting. The symbols for those are inconsistent, making it unclear whether they mean anything beyond their indentation. Overall, I'm wondering whether it would be constructive for me to search for another presentation of the algorithm. Actually, I'm just now realizing the algorithm presented here is just wikipedia text, isn't it? Agfwiki (talk) 18:06, 4 June 2026 (UTC)Reply