sort

Author: hojas

README.md

@@ -20,6 +20,7 @@
 7. [Heap Sort](https://github.com/hojas/typescript-algorithms/tree/main/src/2-algorithms/1-sort/7-heap-sort)
 8. [Counting Sort](https://github.com/hojas/typescript-algorithms/tree/main/src/2-algorithms/1-sort/8-counting-sort)
 9. [Bucket Sort](https://github.com/hojas/typescript-algorithms/tree/main/src/2-algorithms/1-sort/9-bucket-sort)
+10. [Radix Sort](https://github.com/hojas/typescript-algorithms/tree/main/src/2-algorithms/1-sort/10-radix-sort)
 
 ### Search
 

src/2-algorithms/1-sort/10-radix-sort/radix-sort.test.ts

@@ -0,0 +1,11 @@
+import { describe, expect, it } from 'vitest'
+import { radixSort } from './radix-sort'
+
+describe('radix Sort', () => {
+  it('should sort an array of numbers', () => {
+    const nums = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]
+    const expected = [1, 1, 2, 3, 3, 4, 5, 5, 5, 6, 9]
+    const actual = radixSort(nums)
+    expect(actual).to.deep.equal(expected)
+  })
+})

src/2-algorithms/1-sort/10-radix-sort/radix-sort.ts

@@ -0,0 +1,27 @@
+/**
+ * Radix Sort
+ *
+ * O(n * k)
+ * Stable
+ *
+ * @param nums
+ * @returns nums
+ *
+ */
+export function radixSort(nums: number[]): number[] {
+  const max = Math.max(...nums)
+  const digits = Math.floor(Math.log10(max)) + 1
+
+  for (let i = 0; i < digits; i++) {
+    const buckets: number[][] = Array.from({ length: 10 }, () => [])
+
+    for (let j = 0; j < nums.length; j++) {
+      const digit = Math.floor((nums[j] / 10 ** i) % 10)
+      buckets[digit].push(nums[j])
+    }
+
+    nums = buckets.flat()
+  }
+
+  return nums
+}