sort() problem on win7?

http://www.cs.ubc.ca/~harrison/Java/sorting-demo.html

This provides a visual comparison of sorting algorithm speeds.

--

Viewed / responded via the newsgroup at

news.cadsoft.de

Just to inform you why I sort this many entries..

I have several scripts that work on collecting data. One is my own gerber

creator wich initially finds all apertures by putting all wire thicknesses,

smd's and pads onto an array, sorting them by different parameters, and

finding unique by scanning the table for changes.

I have a unusually large board, so I get unusually many entries in the

table.

As a workaround I've done some initial filtering, like not adding the same

aperture again wich reduced the array size alot..

But my initial question is if this is slower on win7 than on xp? I had my

scripts run many times before and I didnt think I added much data after

upgrading my pc (although there is a chance I may have overlooked

something)..

Thanks for checking it up.

"Richard Hammerl"  skrev i nyhetsmeldingen: jpigf6$s0t$1@cheetah.cadsoft.de

...

On 23.05.2012 13:00, Bernhard Schweighofer wrote:

On Wed, 23 May 2012 12:06:47 +0200, Richard Hammerl wrote:

 

>> On 16.05.2012 12:27, Morten Leikvoll wrote:

>>> ... 22min...

>> ...16 mins...

 

That's a joke, isn't it? Sorting 310000 entries shall take more than ten

minutes?

 

I've just generated a "dummy" text document (39 MBytes in size, 3851264

lines - so the entry number is more than ten times as high as in the

example) - sorting (not with eagle, but with the operating system sort)

takes less than 2 seconds with a "core i5-2500" CPU...

 

What kind of sort algorithm is eagle using - bubble sort?

 

regards

Bernhard

Don't know which algorithm is used for that because I am not a

programmer, but maybe sorting 310000 objects is not the main task

of ULPs....

Nonetheless I will forward this to our development guys.

On 23.05.2012 13:00, Bernhard Schweighofer wrote:

On Wed, 23 May 2012 12:06:47 +0200, Richard Hammerl wrote:

 

>> On 16.05.2012 12:27, Morten Leikvoll wrote:

>>> ... 22min...

>> ...16 mins...

 

That's a joke, isn't it? Sorting 310000 entries shall take more than ten

minutes?

 

I've just generated a "dummy" text document (39 MBytes in size, 3851264

lines - so the entry number is more than ten times as high as in the

example) - sorting (not with eagle, but with the operating system sort)

takes less than 2 seconds with a "core i5-2500" CPU...

 

What kind of sort algorithm is eagle using - bubble sort?

 

regards

Bernhard

Don't know which algorithm is used for that because I am not a

programmer, but maybe sorting 310000 objects is not the main task

of ULPs....

Nonetheless I will forward this to our development guys.

--

Mit freundlichen Gruessen / Best regards

Richard Hammerl

  CadSoft Support -- hotline@cadsoft.de

  FAQ: http://www.cadsoft.de/training/faq/

On Wed, 23 May 2012 12:06:47 +0200, Richard Hammerl wrote:

On 16.05.2012 12:27, Morten Leikvoll wrote:

>> ... 22min...

...16 mins...

That's a joke, isn't it? Sorting 310000 entries shall take more than ten

minutes?

I've just generated a "dummy" text document (39 MBytes in size, 3851264

lines - so the entry number is more than ten times as high as in the

example) - sorting (not with eagle, but with the operating system sort)

takes less than 2 seconds with a "core i5-2500" CPU...

What kind of sort algorithm is eagle using - bubble sort?

regards

Bernhard

On 16.05.2012 12:27, Morten Leikvoll wrote:

I tested the same code on an old pentium 4 2.8GHz running xp 32bit and

it executes in 22min.

I expect ALOT better performance on the new i7.

 

>

My laptop with Win7 32 bit and a i5 M520 @2.40Ghz needs 16 mins for it.

--

Mit freundlichen Gruessen / Best regards

Richard Hammerl

  CadSoft Support -- hotline@cadsoft.de

  FAQ: http://www.cadsoft.de/training/faq/

I tested the same code on an old pentium 4 2.8GHz  running xp 32bit and it

executes in 22min.

I expect ALOT better performance on the new i7.

This appears to be some very slow phenomena.. Sorting 310k integers (2 deep)

takes up to 10 minutes on a brand new i7-3820 (3.6GHz, 16G mem, 64bit win)

Is this normal? Does eagle make temp files on system drive? (got flashdrive

now if that matters). Im pretty sure this was a lot faster on my old

computer.

It looks to me like this is a bubblesort algorithm cause an already sorted

dataset is very quick.

Can anyone try this ulp and check the creation time of the start and stop

files created? This specific example takes 10min on my computer.

-

ulp starts here----

output ("Start.txt")

{

    printf("Start time is file creation time");

};

int i=0;int a[];int b[];int index[];

for(i=0;i<310000;i+) a[i]=-i;b[i]=-i;i+;

sort(i,index,a,b);

output ("Stop.txt")

{

    printf("Stop time is file creation time");

};