Comments on: binary search http://erl.nfshost.com/2007/08/11/binary-search/ Tue, 02 Dec 2008 04:51:03 +0000 http://wordpress.org/?v=2.6.3 By: Mark Aufflick http://erl.nfshost.com/2007/08/11/binary-search/#comment-22 Mark Aufflick Tue, 18 Dec 2007 12:08:48 +0000 http://erl.nfshost.com/wordpress/?p=10#comment-22 Hi - I saw the discussion on "The Erlane project" about binary tree v binary search in Erlang. I (also an erlang newbie) found it pretty easy to code a binary tree implementation which I posted on my blog http://mark.aufflick.com/blog/2007/11/30/trees-in-erlang A kind commenter on my blog entry pointed me to the fact that there is a good binary tree implementation in the standard library that comes with your erlang installation in lib/stdlib/src/gb_trees.erl Hi - I saw the discussion on “The Erlane project” about binary tree v binary search in Erlang. I (also an erlang newbie) found it pretty easy to code a binary tree implementation which I posted on my blog http://mark.aufflick.com/blog/2007/11/30/trees-in-erlang

A kind commenter on my blog entry pointed me to the fact that there is a good binary tree implementation in the standard library that comes with your erlang installation in lib/stdlib/src/gb_trees.erl

]]> By: leandro http://erl.nfshost.com/2007/08/11/binary-search/#comment-12 leandro Mon, 29 Oct 2007 20:45:37 +0000 http://erl.nfshost.com/wordpress/?p=10#comment-12 hey, nice post! I concerned about the following line: Elt = lists:nth(Probe, List) Do u know how complex is lists:nth()? Is it O(n) or O(1)? Do u agree that the entire algorithm complexity ll be O(n*log(n)) if nth() is O(n)? Best regards. hey, nice post!

I concerned about the following line:

Elt = lists:nth(Probe, List)

Do u know how complex is lists:nth()? Is it O(n) or O(1)?

Do u agree that the entire algorithm complexity ll be O(n*log(n)) if nth() is O(n)?

Best regards.

]]>