Which of the following statements is true regarding simple sort techniques?
- Aexchange sort if frequently referred to as a bubble sort.
- Bexchange sort is the least expensive.
- Cif 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.
- Dboth insertion sort an selection sort require O(n) moves.