make-github-pseudonymous-again / js-sorting Goto Github PK

Version 0.18.2 of ava just got published.

This version is covered by your current version range and after updating it in your project the build failed.

As ava is “only” a devDependency of this project it might not break production or downstream projects, but “only” your build or test tools – preventing new deploys or publishes.

I recommend you give this issue a high priority. I’m sure you can resolve this 💪

Your Greenkeeper Bot 🌴

https://en.wikipedia.org/wiki/Batcher_odd–even_mergesort

http://en.wikipedia.org/wiki/Quicksort#Repeated_elements

http://en.wikipedia.org/wiki/Stooge_sort

migrate #1, #23, #32

migrated from make-github-pseudonymous-again/js-algorithms#6

see http://www.cs.princeton.edu/courses/archive/spr07/cos226/lectures/04MergeQuick.pdf

https://en.wikipedia.org/wiki/Comb_sort

https://en.wikipedia.org/wiki/Shellsort

migrated from make-github-pseudonymous-again/js-algorithms#5

this

heapsort = sort.__heapsort__( 2 );
heapsort( compare, array, 0, array.length );

could then be written

heapsort = sort.whole(  sort.__heapsort__( 2 ) );
heapsort( compare, array );

migrate #22, #29

https://en.wikipedia.org/wiki/Cocktail_sort

• https://en.wikipedia.org/wiki/Bubble_sort#Optimizing_bubble_sort
• move turtles at the beginning by recording the minimum element for each loop

sifting down instead of sifting up

// >= 0 is necessary when arity = 1 and n = 0
for ( k = ( n + arity - 2 ) / arity | 0 ; k-- >= 0 ; ) {
    siftdown( arity , compare , swap , a , 0 , n , k ) ;
}

migrate #4, #5

http://en.wikipedia.org/wiki/Timsort

http://en.wikipedia.org/wiki/Median_of_medians

migrated from make-github-pseudonymous-again/js-algorithms#4

• use a >= b instead of b <= a
• use > and < instead of >= and <=
• reuse x variable instead of assigning to t

e.g. to be able to specify an algorithm to use in case the input size is small enough

migrated from make-github-pseudonymous-again/js-algorithms#1

http://en.wikipedia.org/wiki/Block_sort

https://en.wikipedia.org/w/index.php?title=Odd–even_sort

the variable s should be decremented after each main loop iteration

move to http://github.com/aureooms/js-int32

http://en.wikipedia.org/wiki/Heapsort#Bottom-up_heapsort

migrate #6, #28

http://en.wikipedia.org/wiki/Cycle_sort

move to http://github.com/aureooms/js-compare ( except increasing / decreasing )

migrate #7

see http://cs.stackexchange.com/questions/11458/quicksort-partitioning-hoare-vs-lomuto

Version 3.1.1 of @aureooms/js-itertools just got published.

</td>

This version is covered by your current version range and after updating it in your project the build failed.

As @aureooms/js-itertools is “only” a devDependency of this project it might not break production or downstream projects, but “only” your build or test tools – preventing new deploys or publishes.

I recommend you give this issue a high priority. I’m sure you can resolve this 💪

Your Greenkeeper Bot 🌴

Split into firstInversion = issorted and isSorted = (compare, a, i, j) => firstInversion(compare, a, i, j) === j.

migrate #30

still not sure if necessary

See https://en.wikipedia.org/wiki/Partial_sorting#Incremental_sorting. Either by using a heap or by executing quicksort step by step through repeated application of quickselect.

Version 7.0.2 of @aureooms/js-in-situ-sort-spec just got published.

This version is covered by your current version range and after updating it in your project the build failed.

As @aureooms/js-in-situ-sort-spec is “only” a devDependency of this project it might not break production or downstream projects, but “only” your build or test tools – preventing new deploys or publishes.

I recommend you give this issue a high priority. I’m sure you can resolve this 💪

Your Greenkeeper Bot 🌴

There is an error with this repository's Renovate configuration that needs to be fixed. As a precaution, Renovate will stop PRs until it is resolved.

Error type: undefined. Note: this is a nested preset so please contact the preset author if you are unable to fix it yourself.

https://en.wikipedia.org/wiki/Gnome_sort

use

while ( true ) {

    if ( ai >= aj ) {
        while ( bi < bj ) { ... }
        return ;
    }

    if ( bi >= bj ) {
        do { ... } while ( ai < aj ) ;
        return ;
    }

    if ( compare( a[ai] , b[bi] ) <= 0 ) {
        ...
    }

    else {
        ...
    }

    ++ci ;

}