Sort method

.github/workflows/test.yml-template

@@ -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

package.json

@@ -17,7 +17,7 @@
   "license": "GPL-3.0",
   "devDependencies": {
     "@mate-academy/eslint-config": "latest",
-    "@mate-academy/scripts": "^1.8.6",
+    "@mate-academy/scripts": "^2.1.3",
     "eslint": "^8.57.0",
     "eslint-plugin-jest": "^28.6.0",
     "eslint-plugin-node": "^11.1.0",

src/arrayMethodSort.js

@@ -4,9 +4,71 @@
  * Implement method Sort
  */
 function applyCustomSort() {
-  [].__proto__.sort2 = function(compareFunction) {
-    // write code here
+  [].__proto__.sort2 = function (compareFunction) {
+    if (
+      typeof compareFunction !== 'function' &&
+      compareFunction !== undefined
+    ) {
+      throw new TypeError('Compare must be a function');
+    }
+
+    const defaultCompare = (a, b) => {
+      const A = String(a);
+      const B = String(b);
+
+      if (A < B) {
+        return -1;
+      }
+
+      if (A > B) {
+        return 1;
+      }
+
+      return 0;
+    };
+
+    const comparator =
+      compareFunction === undefined ? defaultCompare : compareFunction;
+
+    const len = this.length >>> 0;
+    const items = [];
+
+    for (let i = 0; i < len; i++) {
+      if (i in this) {
+        items.push({ val: this[i], idx: i });
+      }
+    }
+
+    for (let i = 0; i < items.length - 1; i++) {
+      for (let j = 0; j < items.length - 1 - i; j++) {
+        const r = comparator(items[j].val, items[j + 1].val);
+        const shouldSwap = r === 0 ? items[j].idx > items[j + 1].idx : r > 0;
+
+        if (shouldSwap) {
+          const tmp = items[j];
+
+          items[j] = items[j + 1];
+          items[j + 1] = tmp;
+        }
+      }
+    }
+
+    let k = 0;
+
+    for (; k < items.length; k++) {
+      this[k] = items[k].val;
+    }
+
+    for (let i = k; i < len; i++) {
+      if (i in this) {
+        delete this[i];
+      }
+    }
+
+    return this;
   };
+
+  [].__proto__.sort = [].__proto__.sort2;
 }
 
 module.exports = applyCustomSort;