# Un fichier utilisé dans sort_prime.py
import math

def is_prime(n):
    """Check if an input integer is prime"""

    # check input type
    err_msg = f"input of 'is_prime' function must be of type int (is {type(n)})"
    assert isinstance(n, int), err_msg

    
    if n < 2:
        is_prime = False
    else:
        is_prime = True
        #max_div = v
        max_div = math.ceil(math.sqrt(n))
        for i in range(2,max_div):
            if n%i == 0:
                is_prime = False
                break

    return is_prime


def sort_list(l):
  """Sort a list in place... no check on types !!!"""

  # the easy way
  # l.sort()

  # the in-depth way
  while True:
    keep_going = False
    for i in range( len(l)-1 ):
      if l[i] > l[i+1]:   
        l[i], l[i+1] = l[i+1], l[i]
        keep_going = True
    if not keep_going:
        break