C# program to sort an integer array using Radix Sort

c# programming, exam questions, c# programming exam-questions,

All Answers

mahmoud2506

2022-05-09

need an explanation for this answer? contact us directly to get an explanation for this answer

Program:

The source code to sort an integer array using radix sort is given below. The given program is compiled and executed successfully on Microsoft Visual Studio.

//C# program to sort an integer array using Radix Sort.

using System;

class Sort
{
    static int MaxItem(int []arr) 
    {
        int max     = 0; 
        int loop    = 0;

        max=arr[0];
        for (loop = 1; loop < arr.Length; loop++)
        {
            if (arr[loop] > max)
                max = arr[loop];
        }
        return max;
    }
 
    static void CountSort(int []arr,int exp) 
    {
        int loop=0;
        int length = arr.Length;

        int [] output = new int[length] ; 
        int [] count  = new int[10]     ;

        for (loop = 0; loop < length; loop++)
            count[(arr[loop] / exp) % 10]++;

        for (loop = 1; loop < 10; loop++)
            count[loop] += count[loop - 1];

        for (loop = length - 1; loop >= 0; loop--)
        {
            output[count[(arr[loop] / exp) % 10] - 1] = arr[loop];
            count[(arr[loop] / exp) % 10]--;
        }

        for (loop = 0; loop < length; loop++)
            arr[loop] = output[loop];
    }
 

    static void RadixSort(int []arr) 
    {
        int exp = 1;
        int max = MaxItem(arr);
        int cond=0;

        while (true)
        { 
            cond=max / exp;

            if (cond <= 0)
                break;
            CountSort(arr, exp);

            exp = exp*10;
        }
    }
 
    static void Main(string[] args)
    {
        int []arr = {22,33,11,44,55,66,77,88};
        int loop = 0;
        
        RadixSort(arr);

        Console.WriteLine("Sorted Array: ");
        for (loop = 0; loop < arr.Length; loop++)
            Console.Write(arr[loop] + " ");

        Console.WriteLine();
    }
}

Output:

Sorted Array:
11 22 33 44 55 66 77 88
Press any key to continue . . .

Explanation:

In the above program, we created a class Sort that contains three static methods MaxItem(), CountSort(), RadixSort(), and Main().

The MaxItem() method is used to find the largest item from the array. The CountSort() and RadixSort() are used to implement radix sort algorithm to sort integer array.

The Sort class also contains the Main() method, The Main() method is the entry point for the program. Here, we created an integer array and then called RadixSort() method that will sort the array in the ascending order and printed the sorted array on the console screen.

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

C# program to sort an integer array using Radix Sort

C# program to sort an integer array using Radix Sort

All Answers

C# Data Structure Solved Programs/Examples

This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now