Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Should be INSIDE STANDARD-LIB: Hashtbl.keys
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Jean-Baptiste Rouquier <jean-baptiste.rouquier@e...>
Subject: Re: [Caml-list] Should be INSIDE STANDARD-LIB: Hashtbl.keys

>With your specification (no repetitions in the list), that function
>would run in quadratic time,
Perhaps I'm all wrong, but when I have to get rid of repetitions in a 
list, I first sort it in O(n log n), then remove the repetitions in O(n).

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: