How to sort in the C language?

There are several sorting algorithms available in the C programming language that can be used to sort arrays or linked lists. Some common sorting algorithms include the following:

1. Bubble Sort: This algorithm compares adjacent elements and gradually swaps the larger elements to the end, with a time complexity of O(n^2).
2. The bubbleSort function takes an array and its length as parameters, then sorts the array in ascending order.
3. Insertion Sort: Dividing the array into two parts – sorted and unsorted, then taking an element from the unsorted part and inserting it into the appropriate position in the sorted part. The time complexity is O(n^2).
4. The function insertionSort sorts an array in ascending order by gradually shifting elements into their correct position.
5. Selection Sort: Each time, select the smallest (or largest) element from the unsorted portion and swap it with the first element of the unsorted portion. The time complexity is O(n^2).
6. The selectionSort function takes an array and its size as parameters and sorts the array in ascending order using the selection sort algorithm.
7. Quick Sort: Select a pivot element, move elements smaller than the pivot to its left side, move elements larger than the pivot to its right side, then recursively quick sort the left and right parts, with a time complexity of O(nlogn).
8. The quickSort function takes an array and two integer values as parameters, representing the array to be sorted and the lower and upper limits of the sorting range. It then recursively sorts the array using the partition function, which assigns a pivot value and rearranges the array elements accordingly.
9. Merge Sort: Divide the array into two subarrays, recursively apply merge sort to each subarray, and then merge the two sorted subarrays into one sorted array, with a time complexity of O(nlogn).
10. [left + n1 + j];
    }

    int i = 0, j = 0, k = left;
    while (i < n1 && j < n2) { if (L[i] <= R[j]) { arr[k] = L[i]; i++; } else { arr[k] = R[j]; j++; } k++; } while (i < n1) { arr[k] = L[i]; i++; k++; } while (j < n2) { arr[k] = R[j]; j++; k++; } }