Re: Optimizing sort-algorithm
- From: "Joel Wilsson" <joel.wilsson@xxxxxxxxx>
- Date: 27 Feb 2007 05:05:06 -0800
On Feb 27, 1:45 pm, "alex" <alexander.ek...@xxxxxxxxx> wrote:
hi,
i'm trying to optimize execution time of bubblesort. it already runs
~10sec faster than the vanilla approach. But it still is ~12times
slower than the c-version. Is there nothing more to get out of?
[...]
The c-version needs ~1sec.
What implementation of Common Lisp are you using?
This is SBCL 1.0.2, an implementation of ANSI Common Lisp.
More information about SBCL is available at <http://www.sbcl.org/>.
SBCL is free software, provided as is, with absolutely no warranty.
It is mostly in the public domain; some portions are provided under
BSD-style licenses. See the CREDITS and COPYING files in the
distribution for more information.
* (defun bubblesort (x size)
[snip])
BUBBLESORT
* (defun main ()
[snip])
MAIN
* (main)
Evaluation took:
0.17 seconds of real time
0.160856 seconds of user run time
0.008781 seconds of system run time
0 calls to %EVAL
0 page faults and
0 bytes consed.
NIL
*
.
- References:
- Optimizing sort-algorithm
- From: alex
- Optimizing sort-algorithm
- Prev by Date: Re: Lisp Syntax - functions versus data
- Next by Date: Re: is a relational db a god tool or not really worth it?
- Previous by thread: Optimizing sort-algorithm
- Next by thread: Re: Optimizing sort-algorithm
- Index(es):
Relevant Pages
|
|
