Radix Sort is a non-comparative sorting algorithm that processes the elements of an array by grouping them based on individual digits or place values. It starts by sorting elements based on the least significant digit and gradually moves to the most significant digit. Radix Sort is efficient for integers or fixed-length strings and has a time complexity of O(nk) in the worst case, where n is the number of elements and k is the number of digits or the maximum length of the strings. It’s often used for sorting numbers in base 10 or other fixed-radix representations.

publicclassRadixSort { publicstaticvoidmain(String[] args) { // Create an integer array to be sorted int[] arr = {53, 8, 32, 58, 962, 14, 215};

// Call the radixSort function to sort the array radixSort(arr);

// Print the sorted array System.out.println(Arrays.toString(arr)); }

/** * Radix Sort algorithm to sort an integer array. * * @param arr The array to be sorted */ publicstaticvoidradixSort(int[] arr) { // Find the maximum number in the array to determine the maximum number of digits intmax= arr[0]; for (inti=1; i < arr.length; i++) { if (arr[i] > max) { max = arr[i]; } } intmaxLength= (max + "").length();

// Create buckets for each digit (0-9) int[][] bucket = newint[10][arr.length];

// Keep track of the number of elements in each bucket int[] bucketElementCounts = newint[10];

// Iterate through each digit place (from least significant to most significant) for (inti=0, n = 1; i < maxLength; i++, n *= 10) { // Distribute elements into buckets based on the current digit for (int value : arr) { intdigitOfElement= value / n % 10; bucket[digitOfElement][bucketElementCounts[digitOfElement]] = value; bucketElementCounts[digitOfElement]++; }

// Reconstruct the array by taking elements from buckets intindex=0; for (intj=0; j < bucketElementCounts.length; j++) { if (bucketElementCounts[j] != 0) { for (intk=0; k < bucketElementCounts[j]; k++) { arr[index] = bucket[j][k]; index++; } } // Reset the bucket element count bucketElementCounts[j] = 0; } } } }