[deprosun]

I am not quite sure what forum this question should have been more appropriate for, so i posted it here. So my question is, how would i read the following expression?
__________________________________________

procedure gcd(a,b: positive integers)
x := a
y := b
while y not equal to 0
r := x mod y
x := y
y := r
return x{gcd( a,b ) is x}

This post has been edited by deprosun: 22 September 2012 - 11:18 AM

[JackOfAllTrades]

Moved to Computer Science

[sepp2k]

What do you mean, how do you read it? Which part are you having trouble reading?

PS: When using a syntax that relies on indentation for semantics (like your pseudo code notation does), you should use code-tags, not manual syntax highlighting, so that the indentation is not lost.

This post has been edited by sepp2k: 22 September 2012 - 08:52 AM

[deprosun]

sepp2k, on 22 September 2012 - 10:52 AM, said:

What do you mean, how do you read it? Which part are you having trouble reading?

PS: When using a syntax that relies on indentation for semantics (like your pseudo code notation does), you should use code-tags, not manual syntax highlighting, so that the indentation is not lost.

I cant understand this sign ":="
x := a
r := x mod y

[sepp2k]

It's the assignment operator.

[KYA]

Most textbooks devote a section of the first chapter or "pre" parts to explaining the syntax they adapt throughout the book.

[macosxnerd101]

I have a tutorial on the Euclidean algorithm that you may find helpful.

[deprosun]

Thanks you so much guys!
macosxnerd101 your tutorial is awesome

[macosxnerd101]

Glad we could help!