Sorting Algorithms

Which sorting algorithm is known for its divide-and-conquer approach, where it repeatedly divides the input array into smaller subarrays until they are sorted and then merges them back together?

Which sorting algorithm repeatedly compares adjacent elements and swaps them if they are in the wrong order, continuing until no more swaps are needed?

Which sorting algorithm finds the minimum element from the unsorted portion of the array and places it at the beginning, then repeats this process until the entire array is sorted?

Which sorting algorithm selects a pivot element, partitions the array into two subarrays based on the pivot, and recursively applies the same process to the subarrays until the entire array is sorted?

Which sorting algorithm builds a sorted array one element at a time by inserting each unsorted element into its correct position in the sorted portion of the array?

Which sorting algorithm is known for its ability to sort large arrays efficiently by dividing the array into smaller subarrays, sorting them recursively, and then combining them back together?

Which sorting algorithm is often used for sorting linked lists, where it repeatedly finds the minimum element from the unsorted portion of the list and moves it to the front?

Which sorting algorithm is based on the idea of repeatedly swapping adjacent elements if they are in the wrong order, moving the larger elements to the end of the array?

Which sorting algorithm is known for its ability to sort arrays in place, meaning it modifies the original array without creating a new one?

Which sorting algorithm is often used for sorting large arrays, where it repeatedly divides the array into smaller subarrays, sorts them recursively, and then combines them back together?

Which sorting algorithm is known for its ability to sort linked lists efficiently by repeatedly finding the minimum element from the unsorted portion of the list and moving it to the front?

Which sorting algorithm is based on the idea of repeatedly swapping adjacent elements if they are in the wrong order, moving the larger elements to the end of the array?

Which sorting algorithm is known for its ability to sort arrays in place, meaning it modifies the original array without creating a new one?

Which sorting algorithm is often used for sorting large arrays, where it repeatedly divides the array into smaller subarrays, sorts them recursively, and then combines them back together?

Which sorting algorithm is known for its ability to sort linked lists efficiently by repeatedly finding the minimum element from the unsorted portion of the list and moving it to the front?