Advertisement
Guest User

Untitled

a guest
Sep 11th, 2018
123
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
OCaml 0.25 KB | None | 0 0
  1. let random_elem lst =
  2.   let i = Random.int @@ length lst in
  3.   nth lst i
  4.  
  5. let rec quicksort = function
  6.     | [] -> []
  7.     | l ->
  8.       let smaller, larger = List.partition (fun y -> y < random_elem l) l in
  9.       quicksort smaller @ (quicksort larger)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement