A) a sorting algorithm that builds a sorted portion by inserting each new element into its proper position
B) logarithmic complexity common in repeatedly halving a search space
C) a double-ended queue that permits insertion and removal at both ends
D) a sorting algorithm that repeatedly selects the smallest or largest remaining element
Answer: D
Explanation: Selection sort means a sorting algorithm that repeatedly selects the smallest or largest remaining element. The other options describe different concepts from this topic.