Answer to Question 12-3

  int largestPrime(const int A[], const int n)
  {
    int bigPrime = 0;
    for(int i = 0; i < n; i++)
    {
      if(A[i] > bigPrime && isPrime(A[i]))
      {
        bigPrime = A[i];
      }
    }
    return bigPrime;
  }