import math
print(math.sqr(4))
輸出結(jié)果：2Epsilon = 10e-16
def fab_h(x):
    '''
    求實(shí)數(shù)的絕對(duì)值
    :param x: R
    '''
    if x >= 0:
        return x
    else:
        return x * -1
def sqrt_h(x, n=2.0):
    '''
    n倍根號(hào)下x
    牛頓迭代法
    '''
    val = x
    last = 0.0
    if n == 2.0:
        while (fab_h(val - last) > Epsilon):
            last = val
            val = (val + x / val) / 2
        return val
    while (fab_h(val - last) > Epsilon):
        last = val
        val = ((n-1)*val + x / val**(n-1)) / n
    return val

# importing cmath library 
import cmath 
# using cmath.sqrt() method 
gfg = cmath.sqrt(3) 
print(gfg)

#!/usr/bin/python
# -*- coding: UTF-8 -*-
import math   # 導(dǎo)入 math 模塊
print "math.pow(100, 2) : ", math.pow(100, 2)
# 使用內(nèi)置，查看輸出結(jié)果區(qū)別
print "pow(100, 2) : ", pow(100, 2)
print "math.pow(100, -2) : ", math.pow(100, -2)
print "math.pow(2, 4) : ", math.pow(2, 4)

import time
import math
import numpy as np
def timeit1():
    s = time.time()
    for i in range(750000):
        z=i**.5
    print ("Took %f seconds" % (time.time() - s))
def timeit2(arg=math.sqrt):
    s = time.time()
    for i in range(750000):
        z=arg(i)
    print ("Took %f seconds" % (time.time() - s))
def timeit3(arg=np.sqrt):
    s = time.time()
    for i in range(750000):
        z=arg(i)
    print ("Took %f seconds" % (time.time() - s))
def timeit4():
    s = time.time()
    for i in range(750000):
        z=math.pow(i,.5)
    print ("Took %f seconds" % (time.time() - s))
timeit1()
timeit2()
timeit3()
timeit4()