Hello FPC-Pascal,
Tuesday, May 24, 2011, 8:25:07 PM, you wrote:
MG> IMO it is simply good manner to ask Tim.
MG> He spent quite some time in testing and tuning and explained the
MG> algorithm in detail, so I guess he will be happy to see his fame
MG> spreading.
Do you know the email address of T
Hello FPC-Pascal,
Tuesday, May 24, 2011, 8:25:07 PM, you wrote:
MG> If you do only the insertion+mergesort, then you have only implemented
MG> a long known improved mergesort variant and you can not call it
MG> TimSort. Of course then you don't need to ask Tim for permission.
Well, in first "try
On Tue, 24 May 2011 19:53:12 +0200
José Mejuto wrote:
> Hello FPC-Pascal,
>
> Tuesday, May 24, 2011, 6:31:56 PM, you wrote:
>
> MG> It uses a lot of tricks, but it seems to me that Tim explained all the
> MG> important things.
> MG> It would be nice, if thetimsort unit has the same license as
On 24 May 2011, at 19:53, José Mejuto wrote:
> Implementing from paper needs permission to licensing ?
Normally not.
> Is the algo
> copyrighted/patented ?
Algorithms cannot be copyrighted. Whether or not it's patented I don't know
(while the individual sorting algorithms have been known for
Hello FPC-Pascal,
Tuesday, May 24, 2011, 6:31:56 PM, you wrote:
MG> It uses a lot of tricks, but it seems to me that Tim explained all the
MG> important things.
MG> It would be nice, if thetimsort unit has the same license as the FCL
(modified
MG> LGPL-2).
MG> Maybe you can ask him for permis
2011/5/24 José Mejuto :
> Hello FPC-Pascal,
>
> Tuesday, May 24, 2011, 1:06:43 PM, you wrote:
>
> >> Why is TimSort specially interesting to you ?
> MG> I need a fast stable sort, so multiple sorts work as expected (contrary
> to
> MG> QuickSort).
> MG> TimSort is a candidate.
>
> That's exactl
"José Mejuto" hat am 24. Mai 2011 um 18:07 geschrieben:
> Hello FPC-Pascal,
>
> Tuesday, May 24, 2011, 1:06:43 PM, you wrote:
>
> >> Why is TimSort specially interesting to you ?
> MG> I need a fast stable sort, so multiple sorts work as expected (contrary
> to
> MG> QuickSort).
Hello FPC-Pascal,
Tuesday, May 24, 2011, 1:06:43 PM, you wrote:
>> Why is TimSort specially interesting to you ?
MG> I need a fast stable sort, so multiple sorts work as expected (contrary to
MG> QuickSort).
MG> TimSort is a candidate.
That's exactly the answer I was looking for, the stabilit
"José Mejuto" hat am 24. Mai 2011 um 11:59 geschrieben:
> Hello FPC-Pascal,
>
> Friday, May 20, 2011, 12:21:43 PM, you wrote:
>
> MG> Is there already a TimSort implementation in fpc?
> MG> http://en.wikipedia.org/wiki/Timsort
>
> Why is TimSort specially interesting to you ?
I nee
Hello FPC-Pascal,
Friday, May 20, 2011, 12:21:43 PM, you wrote:
MG> Is there already a TimSort implementation in fpc?
MG> http://en.wikipedia.org/wiki/Timsort
Why is TimSort specially interesting to you ?
--
Best regards,
José
___
fpc-pascal mailli
On Fri, May 20, 2011 at 9:26 AM, Marco van de Voort wrote:
> In our previous episode, michael.vancann...@wisa.be said:
>> > ?
>> > Is there already a TimSort implementation in fpc?
>> > ?
>> > http://en.wikipedia.org/wiki/Timsort
>>
>> Not to my knowledge.
>
> One reference implementation in the a
In our previous episode, michael.vancann...@wisa.be said:
> > ?
> > Is there already a TimSort implementation in fpc?
> > ?
> > http://en.wikipedia.org/wiki/Timsort
>
> Not to my knowledge.
One reference implementation in the article (the goolge one) is
"GPL-with-classpath-exception" licensed, th
On Fri, 20 May 2011, Mattias Gaertner wrote:
Is there already a TimSort implementation in fpc?
http://en.wikipedia.org/wiki/Timsort
Not to my knowledge.
Michael.___
fpc-pascal maillist - fpc-pascal@lists.freepascal.org
http://lists.freepasc
Is there already a TimSort implementation in fpc?
http://en.wikipedia.org/wiki/Timsort
Mattias
___
fpc-pascal maillist - fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-pascal
14 matches
Mail list logo
