Answers for "radix sort"

radix sort

function getDigit(num, i) {
  return Math.floor(Math.abs(num) / Math.pow(10,i)) % 10
}

function digitCount(num) {
  if(num === 0 ) return 1
  return Math.floor(Math.log10(Math.abs(num))) + 1
}

function mostDigitCount(nums) {
  let maxDigit = 0
  for(let i = 0;i< nums.length;i++) {
    maxDigit = Math.max(maxDigit, digitCount(nums[i]))
  }
  return maxDigit
}

function Radix(nums){
  let maxDigitCount = mostDigitCount(nums)
  for(let k=0; k< maxDigitCount; k++) {
    let digitbucket = Array.from({length:10} , () => [])
    for(let i=0; i< nums.length; i++) {
      let digit = getDigit(nums[i], k)
      digitbucket[digit].push(nums[i])
    }
    nums = [].concat(...digitbucket)
  }
  return nums
}

console.log(Radix([23,123, 23333,444444,55555555]))

radix sort pseudocode

Radix-Sort(A, d)
       for j = 1 to d do
            int count[10] = {0};
            for i = 0 to n do
                count[key of(A[i]) in pass j]++
            for k = 1 to 10 do
                count[k] = count[k] + count[k-1]
            for i = n-1 downto 0 do
                result[ count[key of(A[i])] ] = A[j]
                count[key of(A[i])]--
            for i=0 to n do
                A[i] = result[i]
       end for(j)
 end func

radix sort

//Code by Soumyadeep
//insta id: @soumyadepp

#include <bits/stdc++.h>
#define ll long long

using namespace std;

int maxElement(vector<int> arr)
{
    int m = arr[0];
    for (int i = 0; i < arr.size(); i++)
    {
        if (arr[i] > m)
            m = arr[i];
    }
    return m;
}

int digitCnt(int x)
{
    int z = x;
    int c = 1;
    while (z)
    {
        z /= 10;
        c++;
    }
    return c;
}
void radixSort(vector<int> &arr)
{
    int x = maxElement(arr);               //O(N)
    int countDigits = digitCnt(x);         //O(numberofdigitsinx)
    for (int i = 1; i <= countDigits; i++) //runs number of digits in maximum element in the array
    {
        vector<int> holder[10];
        for (int j = 0; j < arr.size(); j++) //O(N)
        {
            int m = i;
            int k;
            int p = arr[j];
            while (m) //O(logN)
            {
                k = p % 10;
                p /= 10;
                m--;
            }
            holder[k].push_back(arr[j]);
        }
        arr.clear();
        for (int c = 0; c < 10; c++)
        {
            arr.insert(arr.end(), holder[c].begin(), holder[c].end());
        }
    }
    //approx O(ND)
}
int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        vector<int> arr;
        int n, x;
        cin >> n;
        for (int i = 0; i < n; i++)
        {
            cin >> x;
            arr.push_back(x);
        }
        radixSort(arr);
        cout << "The sorted array is " << endl;

        for (int i = 0; i < arr.size(); i++)
            cout << arr[i] << " ";
        cout << endl;
    }
    return 0;
}

radix sort pseudocode

import java.io.*; 
import java.util.*; 
class Radix { 
           static int getMax(int arr[], int n){ 
           int mx = arr[0]; 
           for (int i = 1; i < n; i++) 
                 if (arr[i] > mx) 
                        mx = arr[i]; 
           return mx; 
    } 
   static void countSort(int arr[], int n, int exp) 
    {   
           int output[] = new int[n]; 
           int i; 
           int count[] = new int[10]; 
           Arrays.fill(count,0);
           for (i = 0; i < n; i++) 
                   count[ (arr[i]/exp)%10 ]++; 
           // Change count[i] so that count[i] now contains 
           // actual position of this digit in output[] 
           for (i = 1; i < 10; i++) 
                   count[i] += count[i - 1]; 
           // Build the output array 
           for (i = n - 1; i >= 0; i--){
                   output[count[ (arr[i]/exp)%10 ] - 1] = arr[i]; 
                   count[ (arr[i]/exp)%10 ]--; 
        }
           for (i = 0; i < n; i++) 
                   arr[i] = output[i]; 
    } 
   static void radixsort(int arr[], int n) 
       { // Find the maximum number to know number of digits 
           int m = getMax(arr, n);
           for (int exp = 1; m/exp > 0; exp *= 10) 
                  countSort(arr, n, exp); 
    } 
   static void print(int arr[], int n) 
    { 
        for (int i=0; i<n; i++) 
               System.out.print(arr[i]+" "); 
    } 
    public static void main (String[] args) 
    {    int arr[] = {170, 45, 75, 90, 802, 24, 2, 66}; 
         int n = arr.length; 
         radixsort(arr, n); 
         print(arr, n); 
    } 
} 
JavaCopy