package sequential;

import util.Prime;
import util.PrimeCounter;

public class SequentialPrimeCounter implements PrimeCounter {

	public int countPrimes(int[] nums) {
		int count = 0;
		for (int i = 0; i < nums.length; i++) {
			if (Prime.isPrime(nums[i])) {
				count++;
			}
		}
		return count;
	}
}