Version française
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] Efficiency of 'a list
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Eray Ozkural <exa@k...>
Subject: Re: [Caml-list] Two types of efficiency (Was Efficiency of 'a list)
On Sunday 04 May 2003 10:43, Ville-Pertti Keinonen wrote:
> No.  What you suggested (replace lists with sets, replace arrays with
> maps) would in many places be trading O(1) behavior for O(log n)
> behavior, which certainly doesn't make programs more scalable.

No, it doesn't make sense. It would effectively turn ocaml into an inefficient 
toy language like those "high level languages" that he was talking about.

NO DATA STRUCTURE IS SUITABLE FOR ALL TASKS

Take it from the structure monster,

Cheers,

-- 
Eray Ozkural (exa) <erayo@cs.bilkent.edu.tr>
Comp. Sci. Dept., Bilkent University, Ankara  KDE Project: http://www.kde.org
www: http://www.cs.bilkent.edu.tr/~erayo  Malfunction: http://mp3.com/ariza
GPG public key fingerprint: 360C 852F 88B0 A745 F31B  EA0F 7C07 AE16 874D 539C

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners