A、exchange sort if frequently referred to as a bubble sort.
B、exchange sort is the least expensive.
C、if random data are in an array that is to be sorted ,an insertion sort will give then best performance for large elements with small sort items.
D、both insertion sort an selection sort require O(n) moves.