unsorted matrix search algorithm <p>is there a suitable algorithm that allows a program to search through an unsorted matrix in search of the biggest prime number within. The matrix is of size m*n and may be populated with other prime numbers and non-primes. The search must find the biggest prime.</p> <p>I have studied the divide and conquer algorithms, and binary trees, and step-wise searches, but all of these deal with sorted matrices. </p>