Here is the listing of C# programming examples on Sorting.
C# Examples on Different Types of Sorting Algorithms
The C# programs in this section demonstrate different types of sorting methods. The Selection Sort finds the smallest element in the array and exchanges it with the element in the first position, it then finds the second smallest element and exchanges it with the element in the second position and continues this process until the entire list is sorted. LSDRadix Algorithm is used to sort the keys in integer representation order. Heap Sort is based on binary heap data structure and sorts elements similar to selection sort where the maximum element is placed at the end of the list. The Merge Sort follows the Divide and Conquer rule where in it divides the input array into two halves, sorts the two halves and merges the two sorted halves. The Quick Sort selects an element as a pivot and partitions the given array around the pivot. Bubble Sort repeatedly sorts the adjacent elements if they are in wrong order.
C# Program to Perform Radix Sort
C# Program to Perform a Selection Sort
C# Program to Demonstrate Heap Sort
C# Program to Perform Bubble Sort
C# Program to Perform Insertion Sort
C# Program to Perform Merge Sort
C# Program to Implement Quick Sort