Which sorting algorithm is both in-place and stable under its standard implementation?

You are sorting a list that is already almost sorted. Which algorithm will run fastest in this situation?

A sorting algorithm swaps elements even when they are already in correct order. Which algorithm does this describe?

Quick Sort using recursion has worst-case space complexity of:

Which sorting algorithm can be improved using a flag to detect whether the list is already sorted?

A teacher wants to explain Divide-and-Conquer. Which algorithm is the BEST demonstration?

Binary Search fails to produce correct results when applied to:

In Quick Sort, the worst-case occurs when:

Which algorithm minimizes the number of swaps the most?

Binary Search recursively divides the array in half until one element remains.
For Binary Search on an array of size 32, how many stack frames exist at maximum?

Which search method is guaranteed to check every element in the worst case?

You are sorting a list that is already almost sorted. Which algorithm will run fastest in this situation?

Which sorting algorithm is most suitable when data arrives continuously and needs to remain sorted as new elements are inserted?

Which sorting algorithm is considered out-of-place and also stable?

A list contains many duplicate values. Which algorithm performs worst because it makes unnecessary comparisons?

Binary Search reduces the search space by:

Which algorithm can terminate early if the list becomes sorted during execution?

Which sorting algorithm has the lowest number of data movements, making it suitable for systems with costly write operations?

If each write operation to storage is expensive and should be minimized, which sorting algorithm is the most suitable?

Which algorithm requires data to be sorted BEFORE it can be applied?