Binary search is extremely useful to quickly find something in a sorted collection, like finding if a string or number is included in a large collection. BTW, we already have an implementation, see SequenceableCollection>>#findBinary: and friends.
On 10 Jul 2019, at 18:53, Alexandre Bergel via Pharo-users <pharo-users@lists.pharo.org> wrote:
From: Alexandre Bergel <alexandre.bergel@me.com> 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 <pharo-users@lists.pharo.org>
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 partly because of my lack of expertise in binary search tree and partly because experts in binary search trees assume that people know what it is about and in what it is useful.
My question is, when should a programmer ever need to use binary search tree? Can you add some examples on what these trees are good for, and how an average programmer should look into it. I think this will be a valuable and easy way to expand your blog.
Cheers, Alexandre
On Jul 7, 2019, at 5:12 PM, Smiljana Knezev <smilja.knezev@gmail.com> wrote:
Dear all,
I've written about implementing binary search trees: https://pharokeepers.github.io/pharo/2019/07/07/SmiljanaBinarySearchTreeinPh...
Feedback and opinions is always welcome :)
Best regards, Smiljana Knezev