- Mar 25, 2001
- 5,287
- 6
- 81
Hello all!
I need your help with evaluating and testing?.my benchmark
I was doing a coding project about six months ago about sorting algorithms. I had to practically implement seven most popular algorithms and find the fastest and the slowest one?
This excellent site about sorting algorithms was a great help
I have decided to create my own benchmark!
Here you can find a short explanation on how it works
Feel free to email your comments and results to:
sortmark@computerfix.org
If you would like to send your results please include:
a. Your Operating System (Linux, Windows XP, etc).
b. Your processor speed and type (P IV Norwood 1.8 GHz, AMD Athlon XP 2500+) Please feel free to include as many details about the chip as you can, overclockers are especially encouraged to send-in their results.
c. The motherboard you are using (as may details as you can).
d. The amount of RAM (as many details as you can).
e. Any other information about your system, like video card (not tested by the benchmark, but for example buggy drivers can affect the score), sound card, hard drive details, etc, etc.
f. You comments about the benchmark.
My results:
Windows XP; PIV Northwood CPU 1.8 GHz @ 18x142 Mhz fsb = 2.62 GHZ
mean of 3 runs = 70.92133 seconds.
Linux Mandrake 9.0
mean of 3 runs = 63.99 seconds
Please go here to download the benchmark if you would like to give it a try.
Any file listed on that site has a detailed instruction, but feel free to ask for help if some extra info needed.
During the run, program will create two files: data.dat, which contains the integers to sort, and SortOut.dat that contains arranged numbers. Both are created for verification purposes. Both are being overwritten on every run of the benchmark. They are safe to delete.
06/01/03 edited for clarity
Once again your feedback is important!
I need your help with evaluating and testing?.my benchmark
I was doing a coding project about six months ago about sorting algorithms. I had to practically implement seven most popular algorithms and find the fastest and the slowest one?
This excellent site about sorting algorithms was a great help
I have decided to create my own benchmark!
Here you can find a short explanation on how it works
Feel free to email your comments and results to:
sortmark@computerfix.org
If you would like to send your results please include:
a. Your Operating System (Linux, Windows XP, etc).
b. Your processor speed and type (P IV Norwood 1.8 GHz, AMD Athlon XP 2500+) Please feel free to include as many details about the chip as you can, overclockers are especially encouraged to send-in their results.
c. The motherboard you are using (as may details as you can).
d. The amount of RAM (as many details as you can).
e. Any other information about your system, like video card (not tested by the benchmark, but for example buggy drivers can affect the score), sound card, hard drive details, etc, etc.
f. You comments about the benchmark.
My results:
Windows XP; PIV Northwood CPU 1.8 GHz @ 18x142 Mhz fsb = 2.62 GHZ
mean of 3 runs = 70.92133 seconds.
Linux Mandrake 9.0
mean of 3 runs = 63.99 seconds
Please go here to download the benchmark if you would like to give it a try.
Any file listed on that site has a detailed instruction, but feel free to ask for help if some extra info needed.
During the run, program will create two files: data.dat, which contains the integers to sort, and SortOut.dat that contains arranged numbers. Both are created for verification purposes. Both are being overwritten on every run of the benchmark. They are safe to delete.
06/01/03 edited for clarity
Once again your feedback is important!