sortism 1.0.0

package/LICENSE

@@ -0,0 +1,7 @@
+Copyright 2026 Pro203S
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

package/README.md

@@ -0,0 +1,84 @@
+# sortism
+
+![license](https://img.shields.io/npm/l/sortism) ![stars](https://img.shields.io/github/stars/Pro203S/sortism)
+
+자신에게 맞는 방법으로 배열을 정렬해보세요!  
+이 모듈에는 여러가지의 정렬 방식이 있습니다.  
+자신에게 맞는 정렬을 사용하시면 됩니다.  
+
+## 사용법
+
+1. 패키지 설치
+```sh
+npm i sortism
+
+bun i sortism
+```
+
+2. 모듈 가져오기
+```typescript
+import sortism from 'sortism';
+```
+
+3. 정렬 사용하기
+```typescript
+const arr = [5,2,3,1,4];
+
+// 버블 정렬, 오름차순
+// 1,2,3,4,5
+sortism(arr).bubble("ascending");
+
+// 선택 정렬, 내림차순
+// 5,4,3,2,1
+sortism(arr).selection("descending");
+```
+
+## 자세한 사용법
+
+- Object에서 정렬하기
+```typescript
+const arr = [
+    {
+        "index": 2
+    },
+    {
+        "index": 0
+    },
+    {
+        "index": 2
+    },
+    {
+        "index": 6
+    },
+    {
+        "index": 4
+    },
+    {
+        "index": 3
+    }
+];
+
+// 버블 정렬, 오름차순
+sortism(arr).bubble("ascending");
+
+/*
+returns:
+[
+  {
+    index: 0,
+  }, {
+    index: 2,
+  }, {
+    index: 2,
+  }, {
+    index: 3,
+  }, {
+    index: 4,
+  }, {
+    index: 6,
+  }
+]
+*/
+```
+
+지금 바로 설치해서 사용해보세요!

package/bun.lock

@@ -0,0 +1,26 @@
+{
+  "lockfileVersion": 1,
+  "configVersion": 1,
+  "workspaces": {
+    "": {
+      "name": "sortism",
+      "devDependencies": {
+        "@types/bun": "latest",
+      },
+      "peerDependencies": {
+        "typescript": "^5",
+      },
+    },
+  },
+  "packages": {
+    "@types/bun": ["@types/bun@1.3.11", "", { "dependencies": { "bun-types": "1.3.11" } }, "sha512-5vPne5QvtpjGpsGYXiFyycfpDF2ECyPcTSsFBMa0fraoxiQyMJ3SmuQIGhzPg2WJuWxVBoxWJ2kClYTcw/4fAg=="],
+
+    "@types/node": ["@types/node@25.5.0", "", { "dependencies": { "undici-types": "~7.18.0" } }, "sha512-jp2P3tQMSxWugkCUKLRPVUpGaL5MVFwF8RDuSRztfwgN1wmqJeMSbKlnEtQqU8UrhTmzEmZdu2I6v2dpp7XIxw=="],
+
+    "bun-types": ["bun-types@1.3.11", "", { "dependencies": { "@types/node": "*" } }, "sha512-1KGPpoxQWl9f6wcZh57LvrPIInQMn2TQ7jsgxqpRzg+l0QPOFvJVH7HmvHo/AiPgwXy+/Thf6Ov3EdVn1vOabg=="],
+
+    "typescript": ["typescript@5.9.3", "", { "bin": { "tsc": "bin/tsc", "tsserver": "bin/tsserver" } }, "sha512-jl1vZzPDinLr9eUt3J/t7V6FgNEw9QjvBPdysz9KfQDD41fQrC2Y4vKQdiaUpFT4bXlb1RHhLpp8wtm6M5TgSw=="],
+
+    "undici-types": ["undici-types@7.18.2", "", {}, "sha512-AsuCzffGHJybSaRrmr5eHr81mwJU3kjw6M+uprWvCXiNeN9SOGwQ3Jn8jb8m3Z6izVgknn1R0FTCEAP2QrLY/w=="],
+  }
+}

package/dist/index.d.ts

@@ -0,0 +1,23 @@
+export type InternalSortFunction = <T>(arr: T[], func: (v: T) => number, order: "ascending" | "descending") => T[];
+export type ExportSortFunction<T> = (order: "ascending" | "descending", func?: (v: T) => number) => T[];
+/**
+ * You can use sortism through this function.
+ */
+export default function sortism<T = any>(array: T[], func?: (v: T) => number): {
+    /**
+     * Time: O(n^2)
+     */
+    bubble: ExportSortFunction<T>;
+    /**
+     * Time: O(n^2)
+     */
+    selection: ExportSortFunction<T>;
+    /**
+     * Time: O(n log n)
+     */
+    merge: ExportSortFunction<T>;
+    /**
+     * Time: O(n log n)
+     */
+    quick: ExportSortFunction<T>;
+};

package/dist/index.js

@@ -0,0 +1,28 @@
+import bubble from "./sorts/bubble";
+import merge from "./sorts/merge";
+import quick from "./sorts/quick";
+import selection from "./sorts/selection";
+/**
+ * You can use sortism through this function.
+ */
+export default function sortism(array, func) {
+    const f = func ?? (v => v);
+    return {
+        /**
+         * Time: O(n^2)
+         */
+        "bubble": (order => bubble(array, f, order)),
+        /**
+         * Time: O(n^2)
+         */
+        "selection": (order => selection(array, f, order)),
+        /**
+         * Time: O(n log n)
+         */
+        "merge": (order => merge(array, f, order)),
+        /**
+         * Time: O(n log n)
+         */
+        "quick": (order => quick(array, f, order)),
+    };
+}

package/dist/sorts/bubble.d.ts

@@ -0,0 +1,3 @@
+import type { InternalSortFunction } from "..";
+declare const bubble: InternalSortFunction;
+export default bubble;

package/dist/sorts/bubble.js

@@ -0,0 +1,27 @@
+const bubble = (arr, func, order) => {
+    const indexMap = arr.map(v => ({
+        "index": func(v),
+        "value": v
+    }));
+    const isAsc = order === "ascending";
+    for (let i = 0; i < indexMap.length - 1; i++) {
+        let swapped = false;
+        for (let j = 0; j < indexMap.length - 1 - i; j++) {
+            const current = indexMap[j];
+            const next = indexMap[j + 1];
+            const shouldSwap = isAsc
+                ? current.index > next.index
+                : current.index < next.index;
+            if (shouldSwap) {
+                const temp = indexMap[j];
+                indexMap[j] = indexMap[j + 1];
+                indexMap[j + 1] = temp;
+                swapped = true;
+            }
+        }
+        if (!swapped)
+            break;
+    }
+    return indexMap.map(v => v.value);
+};
+export default bubble;

package/dist/sorts/merge.d.ts

@@ -0,0 +1,3 @@
+import type { InternalSortFunction } from "..";
+declare const merge: InternalSortFunction;
+export default merge;

package/dist/sorts/merge.js

@@ -0,0 +1,48 @@
+const merge = (arr, func, order) => {
+    const indexMap = arr.map(v => ({
+        index: func(v),
+        value: v
+    }));
+    const isAsc = order === "ascending";
+    const mergeSort = (array) => {
+        if (array.length <= 1)
+            return array;
+        const mid = Math.floor(array.length / 2);
+        const left = mergeSort(array.slice(0, mid));
+        const right = mergeSort(array.slice(mid));
+        return mergeArray(left, right);
+    };
+    const mergeArray = (left, right) => {
+        const result = [];
+        let i = 0;
+        let j = 0;
+        while (i < left.length && j < right.length) {
+            const l = left[i];
+            const r = right[j];
+            const shouldTakeLeft = isAsc
+                ? l.index <= r.index
+                : l.index >= r.index;
+            if (shouldTakeLeft) {
+                result.push(l);
+                i++;
+            }
+            else {
+                result.push(r);
+                j++;
+            }
+        }
+        // 남은 요소 처리
+        while (i < left.length) {
+            result.push(left[i]);
+            i++;
+        }
+        while (j < right.length) {
+            result.push(right[j]);
+            j++;
+        }
+        return result;
+    };
+    const sorted = mergeSort(indexMap);
+    return sorted.map(v => v.value);
+};
+export default merge;

package/dist/sorts/quick.d.ts

@@ -0,0 +1,3 @@
+import type { InternalSortFunction } from "..";
+declare const quick: InternalSortFunction;
+export default quick;

package/dist/sorts/quick.js

@@ -0,0 +1,34 @@
+const quick = (arr, func, order) => {
+    const indexMap = arr.map(v => ({
+        index: func(v),
+        value: v
+    }));
+    const isAsc = order === "ascending";
+    const quickSort = (array) => {
+        if (array.length <= 1)
+            return array;
+        const pivot = array[0]; // 첫 요소 기준
+        const left = [];
+        const right = [];
+        for (let i = 1; i < array.length; i++) {
+            const current = array[i];
+            const shouldGoLeft = isAsc
+                ? current.index < pivot.index
+                : current.index > pivot.index;
+            if (shouldGoLeft) {
+                left.push(current);
+            }
+            else {
+                right.push(current);
+            }
+        }
+        return [
+            ...quickSort(left),
+            pivot,
+            ...quickSort(right)
+        ];
+    };
+    const sorted = quickSort(indexMap);
+    return sorted.map(v => v.value);
+};
+export default quick;

package/dist/sorts/selection.d.ts

@@ -0,0 +1,3 @@
+import type { InternalSortFunction } from "..";
+declare const selection: InternalSortFunction;
+export default selection;

package/dist/sorts/selection.js

@@ -0,0 +1,27 @@
+const selection = (arr, func, order) => {
+    const indexMap = arr.map(v => ({
+        index: func(v),
+        value: v
+    }));
+    const isAsc = order === "ascending";
+    for (let i = 0; i < indexMap.length - 1; i++) {
+        let targetIndex = i;
+        for (let j = i + 1; j < indexMap.length; j++) {
+            const current = indexMap[j];
+            const target = indexMap[targetIndex];
+            const shouldUpdate = isAsc
+                ? current.index < target.index
+                : current.index > target.index;
+            if (shouldUpdate) {
+                targetIndex = j;
+            }
+        }
+        if (targetIndex !== i) {
+            const temp = indexMap[i];
+            indexMap[i] = indexMap[targetIndex];
+            indexMap[targetIndex] = temp;
+        }
+    }
+    return indexMap.map(v => v.value);
+};
+export default selection;

package/package.json

@@ -0,0 +1,26 @@
+{
+  "name": "sortism",
+  "description": "The easiest way to sort an array.",
+  "main": "./dist/index.js",
+  "version": "1.0.0",
+  "type": "module",
+  "keywords": [
+    "sort",
+    "algorithm"
+  ],
+  "homepage": "https://github.com/Pro203S/sortism#readme",
+  "scripts": {
+    "watch": "tsc --watch"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/Pro203S/sortism.git"
+  },
+  "devDependencies": {
+    "@types/bun": "latest"
+  },
+  "license": "MIT",
+  "peerDependencies": {
+    "typescript": "^5"
+  }
+}

package/src/index.ts

@@ -0,0 +1,41 @@
+import bubble from "./sorts/bubble";
+import merge from "./sorts/merge";
+import quick from "./sorts/quick";
+import selection from "./sorts/selection";
+
+export type InternalSortFunction = <T>(
+    arr: T[],
+    func: (v: T) => number,
+    order: "ascending" | "descending",
+) => T[];
+
+export type ExportSortFunction<T> = (
+    order: "ascending" | "descending",
+    func?: (v: T) => number,
+) => T[];
+
+/**
+ * You can use sortism through this function.
+ */
+export default function sortism<T = any>(array: T[], func?: (v: T) => number) {
+    const f = func ?? (v => v as number);
+
+    return {
+        /**
+         * Time: O(n^2)
+         */
+        "bubble": (order => bubble(array, f, order)) as ExportSortFunction<T>,
+        /**
+         * Time: O(n^2)
+         */
+        "selection": (order => selection(array, f, order)) as ExportSortFunction<T>,
+        /**
+         * Time: O(n log n)
+         */
+        "merge": (order => merge(array, f, order)) as ExportSortFunction<T>,
+        /**
+         * Time: O(n log n)
+         */
+        "quick": (order => quick(array, f, order)) as ExportSortFunction<T>,
+    };
+}

package/src/sorts/bubble.ts

@@ -0,0 +1,36 @@
+import type { InternalSortFunction } from "..";
+
+const bubble: InternalSortFunction = (arr, func, order) => {
+    const indexMap = arr.map(v => ({
+        "index": func(v),
+        "value": v
+    }));
+
+    const isAsc = order === "ascending";
+
+    for (let i = 0; i < indexMap.length - 1; i++) {
+        let swapped = false;
+
+        for (let j = 0; j < indexMap.length - 1 - i; j++) {
+            const current = indexMap[j]!;
+            const next = indexMap[j + 1]!;
+
+            const shouldSwap = isAsc
+                ? current.index > next.index
+                : current.index < next.index;
+
+            if (shouldSwap) {
+                const temp = indexMap[j]!;
+                indexMap[j] = indexMap[j + 1]!;
+                indexMap[j + 1] = temp;
+                swapped = true;
+            }
+        }
+
+        if (!swapped) break;
+    }
+
+    return indexMap.map(v => v.value);
+}
+
+export default bubble;

package/src/sorts/merge.ts

@@ -0,0 +1,69 @@
+import type { InternalSortFunction } from "..";
+
+const merge: InternalSortFunction = (arr, func, order) => {
+    const indexMap = arr.map(v => ({
+        index: func(v),
+        value: v
+    }));
+
+    const isAsc = order === "ascending";
+
+    const mergeSort = (
+        array: typeof indexMap
+    ): typeof indexMap => {
+        if (array.length <= 1) return array;
+
+        const mid = Math.floor(array.length / 2);
+
+        const left = mergeSort(array.slice(0, mid));
+        const right = mergeSort(array.slice(mid));
+
+        return mergeArray(left, right);
+    };
+
+    const mergeArray = (
+        left: typeof indexMap,
+        right: typeof indexMap
+    ): typeof indexMap => {
+        const result: typeof indexMap = [];
+
+        let i = 0;
+        let j = 0;
+
+        while (i < left.length && j < right.length) {
+            const l = left[i]!;
+            const r = right[j]!;
+
+            const shouldTakeLeft = isAsc
+                ? l.index <= r.index
+                : l.index >= r.index;
+
+            if (shouldTakeLeft) {
+                result.push(l);
+                i++;
+            } else {
+                result.push(r);
+                j++;
+            }
+        }
+
+        // 남은 요소 처리
+        while (i < left.length) {
+            result.push(left[i]!);
+            i++;
+        }
+
+        while (j < right.length) {
+            result.push(right[j]!);
+            j++;
+        }
+
+        return result;
+    };
+
+    const sorted = mergeSort(indexMap);
+
+    return sorted.map(v => v.value);
+};
+
+export default merge;

package/src/sorts/quick.ts

@@ -0,0 +1,46 @@
+import type { InternalSortFunction } from "..";
+
+const quick: InternalSortFunction = (arr, func, order) => {
+    const indexMap = arr.map(v => ({
+        index: func(v),
+        value: v
+    }));
+
+    const isAsc = order === "ascending";
+
+    const quickSort = (
+        array: typeof indexMap
+    ): typeof indexMap => {
+        if (array.length <= 1) return array;
+
+        const pivot = array[0]!; // 첫 요소 기준
+        const left: typeof indexMap = [];
+        const right: typeof indexMap = [];
+
+        for (let i = 1; i < array.length; i++) {
+            const current = array[i]!;
+
+            const shouldGoLeft = isAsc
+                ? current.index < pivot.index
+                : current.index > pivot.index;
+
+            if (shouldGoLeft) {
+                left.push(current);
+            } else {
+                right.push(current);
+            }
+        }
+
+        return [
+            ...quickSort(left),
+            pivot,
+            ...quickSort(right)
+        ];
+    };
+
+    const sorted = quickSort(indexMap);
+
+    return sorted.map(v => v.value);
+};
+
+export default quick;

package/src/sorts/selection.ts

@@ -0,0 +1,37 @@
+import type { InternalSortFunction } from "..";
+
+const selection: InternalSortFunction = (arr, func, order) => {
+    const indexMap = arr.map(v => ({
+        index: func(v),
+        value: v
+    }));
+
+    const isAsc = order === "ascending";
+
+    for (let i = 0; i < indexMap.length - 1; i++) {
+        let targetIndex = i;
+
+        for (let j = i + 1; j < indexMap.length; j++) {
+            const current = indexMap[j]!;
+            const target = indexMap[targetIndex]!;
+
+            const shouldUpdate = isAsc
+                ? current.index < target.index
+                : current.index > target.index;
+
+            if (shouldUpdate) {
+                targetIndex = j;
+            }
+        }
+
+        if (targetIndex !== i) {
+            const temp = indexMap[i]!;
+            indexMap[i] = indexMap[targetIndex]!;
+            indexMap[targetIndex] = temp;
+        }
+    }
+
+    return indexMap.map(v => v.value);
+};
+
+export default selection;

package/tests/index.ts

@@ -0,0 +1,27 @@
+import sortism from './../dist';
+
+const arr = [
+    {
+        "index": 0
+    },
+    {
+        "index": 2
+    },
+    {
+        "index": 2
+    },
+    {
+        "index": 6
+    },
+    {
+        "index": 4
+    },
+    {
+        "index": 3
+    }
+];
+const sort = sortism(arr, (v) => v.index);
+
+const result = sort.selection("ascending");
+
+console.log(result);

package/tsconfig.json

@@ -0,0 +1,31 @@
+{
+  "compilerOptions": {
+    // Environment setup & latest features
+    "lib": ["ESNext"],
+    "target": "ESNext",
+    "module": "Preserve",
+    "moduleDetection": "force",
+    "jsx": "react-jsx",
+    "allowJs": true,
+    "rootDir": "./src",
+    "outDir": "./dist",
+
+    // Bundler mode
+    "moduleResolution": "bundler",
+    "verbatimModuleSyntax": true,
+    "declaration": true,
+
+    // Best practices
+    "strict": true,
+    "skipLibCheck": true,
+    "noFallthroughCasesInSwitch": true,
+    "noUncheckedIndexedAccess": true,
+    "noImplicitOverride": true,
+
+    // Some stricter flags (disabled by default)
+    "noUnusedLocals": false,
+    "noUnusedParameters": false,
+    "noPropertyAccessFromIndexSignature": false
+  },
+  "exclude": ["tests", "dist"]
+}