Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!us.feeder.erje.net!newsfeed.fsmpi.rwth-aachen.de!newsfeed.straub-nv.de!eternal-september.org!feeder.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail From: Paul Rubin Newsgroups: comp.lang.forth Subject: Re: FORTH on the Advanced Placement Computer Science ! Date: Tue, 30 Dec 2014 11:50:00 -0800 Organization: A noiseless patient Spider Lines: 13 Message-ID: <87iogs29zr.fsf@jester.gateway.pace.com> References: <7x4msmqry6.fsf@ruckus.brouhaha.com> <7xa92ew16a.fsf@ruckus.brouhaha.com> <7x8uhy0zon.fsf@ruckus.brouhaha.com> <7x4msm0wf9.fsf@ruckus.brouhaha.com> <7xlhlwwha1.fsf@ruckus.brouhaha.com> <7xvbl0z0jl.fsf@ruckus.brouhaha.com> <7xa92bbpdo.fsf@ruckus.brouhaha.com> <20141225233409.2bec4fb5@maxa-pc> <7x1tnngqt9.fsf@ruckus.brouhaha.com> <20141226022222.6f32fe7f@maxa-pc> <7xd277yybp.fsf@ruckus.brouhaha.com> <20141226052214.6a1e5768@maxa-pc> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: mx02.eternal-september.org; posting-host="782ed8fcdcd37c030dcdb7b43004788c"; logging-data="16436"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/Q41A6nw0e+PUyUZs6uX7z" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/24.3 (gnu/linux) Cancel-Lock: sha1:2wymkuMBUYwcUJ1n2etionT5QNY= sha1:9O7nerNjnvROK/luL5N2g9zIXXo= Xref: csiph.com comp.lang.forth:35350 Melzzzzz writes: > Time to generate list of million nodes of 32bit integers and to sort it > follows:... > real 0m0.388s > user 0m0.387s > sys 0m0.000s I haven't managed to try this program out or play with it yet, but thanks for posting it, it looks interesting. It's around 10x faster than a straightforward C++ implementation using the STL list class with std::list. I wonder what's going on with that. I haven't yet profiled the C++ program. It might be spending most of its time in storage allocation.