Quick sort
-Quick Sort is a divide-and-conquer algorithm that works by selecting a pivot element and partitioning the array around the pivot. After partitioning, the elements smaller than the pivot a-re placed on the left, and the elements greater than the pivot are on the right. The process is repeated recursively for the left and right subarrays.
#.Insertion sort
-Insertion sort is an in-place comparison-based sorting algorithm. It works by repeatedly selecting the minimum element (or maximum, depending on the order) from the unsorted portion of the array and swapping it with the first unsorted element. This process is repeated until the entire array is sorted.
Quick sort
-Quick Sort is a divide-and-conquer algorithm that works by selecting a pivot element and partitioning the array around the pivot. After partitioning, the elements smaller than the pivot a-re placed on the left, and the elements greater than the pivot are on the right. The process is repeated recursively for the left and right subarrays.
#.Insertion sort
-Insertion sort is an in-place comparison-based sorting algorithm. It works by repeatedly selecting the minimum element (or maximum, depending on the order) from the unsorted portion of the array and swapping it with the first unsorted element. This process is repeated until the entire array is sorted.