In insertion sort, how are elements processed?
-
A
Each element is inserted into its correct position among already-sorted elements
-
B
Adjacent elements are swapped if out of order
-
C
The minimum is selected and moved front
-
D
The array is recursively divided