Algorithm that tests for prime numbers, with O(√n) time complexity.
-
Updated
Jul 8, 2019 - Swift
Algorithm that tests for prime numbers, with O(√n) time complexity.
Add a description, image, and links to the big-o-performance topic page so that developers can more easily learn about it.
To associate your repository with the big-o-performance topic, visit your repo's landing page and select "manage topics."