Algorithm for finding max and min in an array.

Hi guys, hope you are well. I am trying to create an algorithm which finds the maximum and minimum in an array A, with length n.

I have an algorithm here, but by accident I forgot it was from an array, instead I did from a list of command line arguments. Here is my algorithm:

Code:

---

int maxNumber
int minNumber

for (i from 0 upto length of elements)
{ int aGivenValue
  { if aGivenValue>maxNumber)
    then maxNumber = aGivenValue
  }
}

for (i from 0 upto length of elements)
{ int anotherGivenValue
 { if anotherGivenValue < minNumber)
  then minNumber = anotherGivenValue
  }
  return min and max value
}
}

---

I'd like to tweek it so it uses arrays. Any suggestions I'm really stuck :( . I've also created this program and it works but it doesn't use an array, so how would I make it use arrays.

Kind regards

Shyam

What have you tried in real code? That pseudocode seems pretty good. You can find the length of some array by using arrayName.length.

I've sorted it. I'm stuck on this other one now. I'm doing greatest common divisor. I've done some pseudocode, but I now need to create another algorithm which uses Euclidean algorithm to find the GCD of two values. Here is my first algorithm:

Code:

---

int u
int v
int multiple1 = u
int multiple2 = v

while(multiple1 is not equal to multiple2)
  if multiple1 > multiple2
    then multiple1-multiple2
  else
    then multiple2-multiple1

s.o.p "GCD of " + u + " and " + v + "is" + multiple1

---

How can i write another algorithm using Euclidean to find gcd. I'm stuck on this part.. i don't understand how i would do it.

How would you do Euclidean gcd of 135 and 45 by hand?

Also, in case you need some help on how euclidean GCD works, here is a bit of a tip:

Given two integers, a and b, if r is the remainder of a divided by b, then the common divisor of a and b is also a divisor of r. It is straightforward enough to develop this recursively.