From 73ace6049f90248b5f76a41025c93bcbdfa5c5dc Mon Sep 17 00:00:00 2001 From: Priyangshu yogi Date: Fri, 29 Dec 2017 11:17:08 +0530 Subject: [PATCH] Update README.md --- .../Math/Primality Test/Optimized School Method/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Competitive Coding/Math/Primality Test/Optimized School Method/README.md b/Competitive Coding/Math/Primality Test/Optimized School Method/README.md index 6ef6b5465..fcb900fe9 100644 --- a/Competitive Coding/Math/Primality Test/Optimized School Method/README.md +++ b/Competitive Coding/Math/Primality Test/Optimized School Method/README.md @@ -25,4 +25,4 @@ as (6k + i) for some integer k and for i = ?1, 0, 1, 2, 3, or 4; 2 divides (6k (6k + 3). So a more efficient method is to test if n is divisible by 2 or 3, then to check through all the numbers of form 6k ± 1. -Time complexity of this solution is O(√n). +Time complexity of this solution is O(root(n)).