Path: csiph.com!newsfeed.xs4all.nl!newsfeed9.news.xs4all.nl!3.eu.feeder.erje.net!feeder.erje.net!usenet.goja.nl.eu.org!news.freedyn.de!eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail From: Tim Rentsch Newsgroups: comp.lang.c++ Subject: Re: "Performance of C++20's Ranges" Date: Fri, 29 Apr 2022 16:15:10 -0700 Organization: A noiseless patient Spider Lines: 28 Message-ID: <864k2b5vnl.fsf@linuxsc.com> References: Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Injection-Info: reader02.eternal-september.org; posting-host="947a81ba8a661bedfa1d3062f5b6bffa"; logging-data="4765"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18+dZWF2OWSAp8tbJC1Rt/OxVYdt4AUy+o=" User-Agent: Gnus/5.11 (Gnus v5.11) Emacs/22.4 (gnu/linux) Cancel-Lock: sha1:nTN8JuARiFhEkU/NkeMZxJZkytI= sha1:1n09M8wZNTVXwR7t7ZsPNVwvN8o= Xref: csiph.com comp.lang.c++:83888 Muttley@dastardlyhq.com writes: > On Wed, 27 Apr 2022 16:09:18 GMT > scott@slp53.sl.home (Scott Lurndal) wrote: > >> Muttley@dastardlyhq.com writes: >> >>> On Wed, 27 Apr 2022 08:40:29 -0000 (UTC) >>> Juha Nieminen wrote: >>> >>>> And that's just with an algorithm as simple as a binary search. >>>> Consider much more complex algorithms (or data containers). >>> >>> Thats why I said basic algorithms. I'm not suggesting everyone >>> should re-implement red-black trees themselves. >> >> They probably should have done it once, during training on >> data structures, along with building all the other standard >> structures (stack, list, tree (binary, general, red/black, etc)) >> from first principles (including table-based implementations >> where the links are indicies rather than pointers). > > In in interview once I was asked to write pseudo code for > re-balancing a tree so it certainly does help! Just out of curiosity, what kind of tree were you asked to rebalance? Or did they not say what kind (in which case you would get to pick)?