Python ARE

# -*- coding : utf-8 -*-

## EXERCICE 2.1

# Question 4

import time

def racine(a, n, x0):
    if n == 0 :
        return a
    r= racine(a,n-1,x0)
    return 0.5*(r+a/r)

# Question 2

def p(x):
    return 4*x**3 - 2*x*x + x + log(2)

# Question 3

def N(x,mu,et):
    return (1/(et*racine(2*pi))*exp(-(x-mu)**2/(2*et**2)))

# suite de fibonacci

def fibnaif(n):
    if n == 0:
        return 0
    if n == 1:
        return 1
    return fib(n-1)+fib(n-2)

def fib2(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else :
        if n == 2:
            return 1,0
        else:
            a = fib2(n-1)
            return a[0]+a[1],a[0]
def fib(n):
    t = time.time()
    a = fib2(n)
    print((time.time() - t)*1000, " ms écoulées")
    return a[0]+a[1]


# feuille 1 exo 2.4
# question 4

def croissantes(t,i):
    if i==0:
        return True
    if t[i] < t[i-1] :
        return False
    return croissantes(t,i-1)

# paquet d'exo de la feuille
def a2p(a):
    if a < -3000:
        return "Préhistoire"
    if a < 476:
        return "Antiquité"
    if a < 1492:
        return "Moyen age"
    if a < 1643:
        return "Renaissance"
    if a < 1789:
        return "Monarchie absolue"
    if a < 1815:
        return "Revolution"
    if a < 2015:
        return "Temps modernes"
    return "vers le futur..."

def ligne(n):
    for i in range(n):
        print("*", end="")

def rectangle(l,L):
    for i in range(l):
        ligne(L)
        print("\n")

def triangle(l):
    for i in range(1,l+1):
        ligne(i)
        print("\n")

def somme_cumul():
    somme = 0
    for i in range(0,10):
        somme = somme + i
        print(somme)

def pom(max):
    n = rand_int(0,max)
    min = 0

    while t != 50:
        pm= input()
        if pm == '+' :
            min = min + max/2
        else :
            max = (max - min)/2
        t = (max + min) / 2