On Mon, May 2, 2022 at 2:25 AM jan via Python-list
wrote:
> Hi,
>
> > The median-of-three partitioning technique makes that work reasonably
> well, so it won't be pathologically slow
>
> Just to be clear because I've wondered but haven't looked into it, we
> know naive quicksorting of already-sor
On 5/2/22 07:09, charles hottel wrote:
> Some versions of Quicksort switch over to Straight Insertion Sort when
> the partitions become small enough. The correct size will vary depending
> on the hardware.
>
> I have not kept up with the latest improvements and I am not familiar
> with TimSort.
On 5/1/2022 7:45 PM, Chris Angelico wrote:
On Mon, 2 May 2022 at 09:20, Dan Stromberg wrote:
On Sun, May 1, 2022 at 1:44 PM Chris Angelico wrote:
On Mon, 2 May 2022 at 06:43, Dan Stromberg wrote:
On Sun, May 1, 2022 at 11:10 AM Chris Angelico wrote:
On Mon, 2 May 2022 at 01:53, Nas Ba
Hi,
> The median-of-three partitioning technique makes that work reasonably
well, so it won't be pathologically slow
Just to be clear because I've wondered but haven't looked into it, we
know naive quicksorting of already-sorted data is pathalogical, but
median-of-3 is known to fix this pathology
On Mon, 2 May 2022 at 09:20, Dan Stromberg wrote:
>
>
> On Sun, May 1, 2022 at 1:44 PM Chris Angelico wrote:
>>
>> On Mon, 2 May 2022 at 06:43, Dan Stromberg wrote:
>> > On Sun, May 1, 2022 at 11:10 AM Chris Angelico wrote:
>> >>
>> >> On Mon, 2 May 2022 at 01:53, Nas Bayedil wrote:
>> >> > We
On Sun, May 1, 2022 at 1:44 PM Chris Angelico wrote:
> On Mon, 2 May 2022 at 06:43, Dan Stromberg wrote:
> > On Sun, May 1, 2022 at 11:10 AM Chris Angelico wrote:
> >>
> >> On Mon, 2 May 2022 at 01:53, Nas Bayedil wrote:
> >> > We believe that using this method to develop completely new, fast
On Mon, 2 May 2022 at 01:53, Nas Bayedil wrote:
> We believe that using this method to develop completely new, fast
> algorithms, approaching the speed of the famous *QuickSort*, the speed of
> which cannot be surpassed, but its drawback can be circumvented, in the
> sense of stack overflow, on so
This probably should start out as a module on Pypi.
Is the sorting stable? Python guarantees that.
On Sun, May 1, 2022 at 8:53 AM Nas Bayedil wrote:
> *Dear, Sir/Madam*
>
>
> Let me first tell you briefly who we are and where we are from, what we do.
>
> My name is Nas (full name Nasipa Bayedil
I suppose you should write to python-...@python.org , or in
https://discuss.python.org/ under the section Core development
--
https://mail.python.org/mailman/listinfo/python-list
*Dear, Sir/Madam*
Let me first tell you briefly who we are and where we are from, what we do.
My name is Nas (full name Nasipa Bayedil) from Kazakhstan.
In December 2020, we registered a company online in Dover, Delaware, the
United States, because all major corporations are based in the United
10 matches
Mail list logo
