Which sorting algorithm chooses a "pivot" element and places smaller elements to the left and larger elements to the right?

One of the fastest sorting algorithms for sorting very small input.

Which algorithm sorts the array by repeatedly dividing it into two halves and merging them in a sorted way?

This simple sorting technique repeatedly finds the minimum value from the unsorted portion of the array and moves it to its correct position by exchanging it with the current index.

It is the process of arranging data or elements in a specific order, such as ascending or descending, to make searching and organizing more efficient.

This sorting algorithm works by repeatedly stepping through the list, comparing each pair of adjacent items, and swapping them if they are in the wrong order, until no more swaps are needed.

______ this process until a pass completes with no exchanges.

What Sorting Algorithm is very efficient for large datasets and guarantees a time complexity?

What sorting algorithm uses a binary data structure?

Heap Sort uses a special tree-like structure called a _____.