A sort which relatively passes through a list to exchange the first element with any elementless than it and then repeats with a new first element is called

• A. selection sort.
• B. insertion sort.
• C. quick sort.
• D. heap sort.