### Bookstore

 Computer Math and Games in Pascal (preview) Lazarus Handbook

### Author Topic: Parallel bucketsort have been updated to version 1.03  (Read 3000 times)

#### aminer

• Hero Member
• Posts: 956
##### Parallel bucketsort have been updated to version 1.03
« on: September 15, 2012, 11:49:27 pm »

Hello,

I have updated parallel bucketsort to version 1.03 , and
now it's more faster i have changed a little bit the interface,
now you have to pass to the bucketsort method four
parameters: the array,a TSortCompare function and a TSort1 function and a constant ctAscending or ctDescending to sort
in ascending or descending order.

The TSort1 function have changed, now in the TSort1 function
you have to return the first character and the second character
and the length of the string.

Like this:

function func1(Item1:Pointer;var a,b:char):integer;
begin
a:=TStudent(Item1).mystring[1];
if length(TStudent(Item1).mystring)>1
then b:=TStudent(Item1).mystring[2];
result:=length(TStudent(Item1).mystring);
end;

I have designed the interface of TSort1 like that to optimize  more
parallelbucketsort.

Thank you,
Amine Moulay Ramdane.

#### aminer

• Hero Member
• Posts: 956
##### Re: Parallel bucketsort have been updated to version 1.03
« Reply #1 on: September 15, 2012, 11:50:58 pm »

Hello,

http://pages.videotron.com/aminer/

Thank you,
Amine Moulay Ramdane.

#### aminer

• Hero Member
• Posts: 956
##### Re: Parallel bucketsort have been updated to version 1.03
« Reply #2 on: September 16, 2012, 03:43:10 am »

Hello,

I have simplified the TSort1 function in version 1.04
now the interface is easier , you have to return just a
pointer like this:

function func1(Item1:Pointer): pointer;
begin
result:=pointer(TStudent(Item1).mystring) ;
end;

parallel bucketsort from:

http://pages.videotron.com/aminer/

Thank you,
Amine Moulay Ramdane.