Re: [Pharo-users] [GSoC blog post] Binary Search Trees

--- Begin Message --- Thanks for your detailed answers Cheers, Alexandre > On Jul 12, 2019, at 8:49 AM, Richard O'Keefe wrote: > > Search trees (which come in many varieties) are good for collections in which > adding, deleting, and lookup are interleaved, where there is an order on the >

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

Search trees (which come in many varieties) are good for collections in which adding, deleting, and lookup are interleaved, where there is an order on the elements (if used as a set) or the keys (if used as a dictionary). So are hash tables. But (balanced) search trees have guaranteed O(lg n)

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

On Thu, 11 Jul 2019 at 00:53, Alexandre Bergel via Pharo-users wrote: > > Hello Smiljana, > > Thanks for having written down this document. I am not expert in algorithm, > so I would consider myself a simple user. I have developed complex software > for some times and I have never seen the need

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

On Wed, Jul 10, 2019 at 9:53 AM Alexandre Bergel via Pharo-users < pharo-users@lists.pharo.org> wrote: > Hello Smiljana, > > Thanks for having written down this document. I am not expert in > algorithm, so I would consider myself a simple user. I have developed > complex software for some times

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

re Bergel via Pharo-users > wrote: > > > From: Alexandre Bergel > Subject: Re: [Pharo-users] [GSoC blog post] Binary Search Trees > Date: 10 July 2019 at 18:53:01 GMT+2 > To: Any question about pharo is welcome > > > Hello Smiljana, > > Thanks for havin

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

--- Begin Message --- Hello Smiljana, Thanks for having written down this document. I am not expert in algorithm, so I would consider myself a simple user. I have developed complex software for some times and I have never seen the need of having a binary search tree. I guess this is probably

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

Thank you all very much. This is quite useful for me and I can learn a lot. best regards, Smiljana Knezev сре, 10. јул 2019. у 12:29 Ben Coman је написао/ла: > I agree #bfs: is not explicit, but #breadthFirstSearch: is a well > know term, why not just that? Or even #breathFirstSearchFor: > >

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

I agree #bfs: is not explicit, but #breadthFirstSearch: is a well know term, why not just that? Or even #breathFirstSearchFor: In comparison #findBreadthFirst: and #findDeepFirst: feel a bit awkward to me. (I think its the repetition rhythm of "f" words) cheers -ben On Mon, 8 Jul 2019 at

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

Smiljana Knezev wrote > Dear all, > > I've written about implementing binary search trees: > https://pharokeepers.github.io/pharo/2019/07/07/SmiljanaBinarySearchTreeinPharo.html > > Feedback and opinions is always welcome :) > > Best regards, > Smiljana Knezev Your implementation is

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

bfs: aValue => findBreadthFirst: aValue dfs: info node: aNode => findDeepFirst: aValue startingFrom: aNode

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

> On 8 Jul 2019, at 05:57, ducasse wrote: > > More feedback :) > > Do not return nil > Check the last lecture of the mooc > > Did you read Pharo with Style? > > I do not know if LinkedList is the one of the system used by Process but in > that case use the alternate implementation.

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

More feedback :) Do not return nil Check the last lecture of the mooc Did you read Pharo with Style? I do not know if LinkedList is the one of the system used by Process but in that case use the alternate implementation. bfs: info "Breadth fisrt search for an information. If there

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

> On 8 Jul 2019, at 05:51, ducasse wrote: > > > >> On 7 Jul 2019, at 23:12, Smiljana Knezev > > wrote: >> >> Dear all, >> >> I've written about implementing binary search trees: >>

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

> On 7 Jul 2019, at 23:12, Smiljana Knezev wrote: > > Dear all, > > I've written about implementing binary search trees: > https://pharokeepers.github.io/pharo/2019/07/07/SmiljanaBinarySearchTreeinPharo.html > >

[Pharo-users] [GSoC blog post] Binary Search Trees

Dear all, I've written about implementing binary search trees: https://pharokeepers.github.io/pharo/2019/07/07/SmiljanaBinarySearchTreeinPharo.html Feedback and opinions is always welcome :) Best regards, Smiljana Knezev