(* 2.1 tri par insertion *)

let rec insert x = function
   [] -> []
  |e::l when x <= e -> x::e::l
  |e::l -> e:: insert x l ;;

insert 15 [1;5;8;45];;

(* let rec tri_insertion l = *)
  let rec tri_insertion = function
      [] -> []
    | x::[] -> [x]
    | x::l -> insert x (tri_insertion l)
     ;;

tri_insertion [5; 8; 3; 6; 7];;

(* tri par sélection *)

  let minimum l =
    let rec mini l i =
    match l with
    [] -> i
      | x::l when x > i -> mini l i
      | x::l -> mini l x
    in
    mini l max_int
;;


minimum [3;4;5];;

  let rec supprime n = function
     [] -> []
    |e::l -> if e = n then l else e::supprime n l ;;

  let rec tri_selection l =