Merge pull request #3 from LeandroTk/big-o-aditional

Big o aditional

Author: imteekay

big_o/example21.py

@@ -0,0 +1,22 @@
+def sqrt(n):
+    return sqrt_helper(n, 1, n)
+
+def sqrt_helper(n, min, max):
+    if min > max:
+        return -1
+
+    guess = (min + max) / 2
+
+    if guess * guess > n:
+        return sqrt_helper(n, min, guess - 1)
+    elif guess * guess < n:
+        return sqrt_helper(n, guess + 1, max)
+    else:
+        return guess
+
+print(sqrt(100))
+print(sqrt(9))
+print(sqrt(25))
+print(sqrt(3))
+
+# Complexity: O(log N) --> It is a binary search algorithm

big_o/example22.py

@@ -0,0 +1,15 @@
+from math import sqrt
+
+def square_root(n):
+    for guess in range(int(sqrt(n))+1):
+        if guess * guess == n:
+            return guess
+
+    return -1
+
+print(square_root(100))
+print(square_root(9))
+print(square_root(25))
+print(square_root(3))
+
+# Complexity: O(log N) --> It is a binary search algorithm

interview_training/cracking_the_coding_interview/big_o/aditional5.py

@@ -0,0 +1,22 @@
+def sqrt(n):
+    return sqrt_helper(n, 1, n)
+
+def sqrt_helper(n, min, max):
+    if min > max:
+        return -1
+
+    guess = (min + max) / 2
+
+    if guess * guess > n:
+        return sqrt_helper(n, min, guess - 1)
+    elif guess * guess < n:
+        return sqrt_helper(n, guess + 1, max)
+    else:
+        return guess
+
+print(sqrt(100))
+print(sqrt(9))
+print(sqrt(25))
+print(sqrt(3))
+
+# Complexity: O(log N) --> It is a binary search algorithm

interview_training/cracking_the_coding_interview/big_o/aditional6.py

@@ -0,0 +1,15 @@
+from math import sqrt
+
+def square_root(n):
+    for guess in range(int(sqrt(n))+1):
+        if guess * guess == n:
+            return guess
+
+    return -1
+
+print(square_root(100))
+print(square_root(9))
+print(square_root(25))
+print(square_root(3))
+
+# Complexity: O(log N) --> It is a binary search algorithm