selectionsort

Selection sort with O(n^2) time complexity

by addyosmani

Star on GitHub Forknpm

JavaScript

56 stars 5 forks 4 contributorsQuiet · 11y agoSince 2015

Meet the team

See all 4 on GitHub →

addyosmani11 contributions

coderaiser2 contributions

lipis1 contribution

Languages

View on GitHub →

JavaScript100%

Commit activity

Last 12 weeks · 0 commits

Full graph →

Community health

1 of 6 standards met

Community profile →

✓README○License○Contributing○Code of Conduct○Issue Template○PR Template

Recent fixes

View closed PRs →

Proposal for immutabilityMergedPR

How about if would create a new sorted array instead of changing the passed array?

stoeffel · 5y ago

resolves #4MergedPR

fix wrong usage of assert fix failing tests

stoeffel · 11y ago

add example of usage with a comparatorMergedPR

I first thought that is missing a possibility to use your own comparator, because it wasn't described in the readme.

stoeffel · 11y ago

Structured data for AI agents

Repository: addyosmani/selectionsort. Description: Selection sort with O(n^2) time complexity Stars: 56, Forks: 5. Primary language: JavaScript. Languages: JavaScript (100%). Open PRs: 0, open issues: 0. Last activity: 11y ago. Community health: 28%. Top contributors: addyosmani, coderaiser, lipis.