-
Notifications
You must be signed in to change notification settings - Fork 2.6k
fdsfsd #2477
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: master
Are you sure you want to change the base?
fdsfsd #2477
Changes from all commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,23 @@ | ||
| name: Test | ||
|
|
||
| on: | ||
| pull_request: | ||
| branches: [ master ] | ||
|
|
||
| jobs: | ||
| build: | ||
|
|
||
| runs-on: ubuntu-latest | ||
|
|
||
| strategy: | ||
| matrix: | ||
| node-version: [20.x] | ||
|
|
||
| steps: | ||
| - uses: actions/checkout@v2 | ||
| - name: Use Node.js ${{ matrix.node-version }} | ||
| uses: actions/setup-node@v1 | ||
| with: | ||
| node-version: ${{ matrix.node-version }} | ||
| - run: npm install | ||
| - run: npm test |
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -4,8 +4,30 @@ | |
| * Implement method Sort | ||
| */ | ||
| function applyCustomSort() { | ||
| [].__proto__.sort2 = function(compareFunction) { | ||
| // write code here | ||
| [].__proto__.sort2 = function (compareFunction) { | ||
| let cmp; | ||
|
|
||
| if (typeof compareFunction === 'function') { | ||
| cmp = (a, b) => compareFunction(a, b); | ||
| } else { | ||
| cmp = (a, b) => | ||
| String(a) > String(b) ? 1 : String(a) < String(b) ? -1 : 0; | ||
| } | ||
|
|
||
| for (let i = 0; i < this.length; i++) { | ||
| let b = 0; | ||
|
|
||
| for (let j = i; j < this.length; j++) { | ||
| if (cmp(this[i], this[j]) > 0) { | ||
| b = this[i]; | ||
| this[i] = this[j]; | ||
| this[j] = b; | ||
| b = 0; | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. This line reassigning |
||
| } | ||
| } | ||
| } | ||
|
|
||
| return this; | ||
| }; | ||
| } | ||
|
|
||
|
|
||
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This inner loop starts by comparing an element with itself (
jstarts ati). To make the code slightly more efficient, you can start the loop fromj = i + 1.