I have a brute-force algorithm that takes an input n, and displays the first n prime numbers. The code works, but I also have to answer this question:
Give the number of test items that would be required to assure correctness.
Is there a way to calculate this? Would I technically need to test every possible int value (all 2 billion possibilities)?
Aucun commentaire:
Enregistrer un commentaire