analyse.ml 682 B

12345678910111213141516171819202122232425262728293031323334353637
  1. let factorielle1 n =
  2. let p = ref 1 in
  3. for i = 1 to n do
  4. p := !p * i
  5. done;
  6. !p
  7. ;;
  8. factorielle1 5;;
  9. let maximum t = let max = ref 0 in
  10. for i = 0 to Array.length t - 1 do
  11. if t.(i) > !max then max := t.(i)
  12. done;
  13. !max
  14. ;;
  15. let recherche t x = let n = Array.length t and i = ref 0 in
  16. while !i < n && t.(!i) <> x do
  17. i := !i + 1
  18. done;
  19. !i < n
  20. ;;
  21. let rec factorielle2 n = if n = 0 then 1 else n * factorielle2 (n - 1);;
  22. let rec pgcd a b = if b = 0 then a else pgcd b (a mod b);;
  23. let min3 a b c = if a <= b && a <= c then a else if b <= a && b <= c then b else c;;
  24. let puissance x n = let p = ref 1 in
  25. for k = 1 to n do
  26. p := !p * x
  27. done;
  28. !p
  29. ;;