PPT Slide
Rotation Algorithm
for k := 1 to n do
cobegin i : ə : n>
cobegin j : ə : n>
if i > k then b(i, j) := b(i, j Rot 1)
if j > k then c(i, j) := c(i Rot 1, j)
coend
coend
enddo
Rot is a column (row) operation
which shifts columns up (or
rows to right)
cobegin i : ə : n>
cobegin j : ə : n>
temp (i, j) := b(i, j) x c(i, j)
for k := 1 to n do
begin
b(i, j) := b(i, j Rot 1)
c(i, j) := c(i Rot 1, j)
temp(i, j) := temp(i, j) + b(i, j) x c(i, j)
enddo
a(i, j) := temp(i, j)
coend
coend
Previous slide
Next slide
Back to first slide
View graphic version