Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

1.1k questions

1.2k answers


524 users

+1 vote

Dear SC team,

i have a couple of questions regarding the algorithm at 2-53.

  1. Why do we have to "find i>=k>=n" if k is the running index of the for loop (the first one given in the algorithm). Is this a typo or is there somthing i have overlooked? 
  2. Where does the running index j come from in the last two for-loops?

Thanks for answers in advance.

Best Regards,

Arne Stoll

in * TF "Vis. and Sci. Comp." by (180 points)

1 Answer

+1 vote
Hi Arne,

1. Typo, indeed. k is the current row, i is the sought row with the pivot element. So k <= i <= n is correct.

2. In fixing another typo, I deleted a line accidentally deleted a line. The outer loop over j=1...n was missing.

Corrected slides in OLAT.

Thanks for pointing this out!
by (280 points)

Related questions

+2 votes
1 answer
asked Nov 15, 2019 in * TF "Vis. and Sci. Comp." by Kevin Iselborn (170 points)
0 votes
1 answer
asked Jun 13, 2020 in * TF "Vis. and Sci. Comp." by nafisur (300 points)
0 votes
2 answers
0 votes
1 answer
0 votes
1 answer
Imprint | Privacy Policy