In class we discussed 2 different iterative sorting algorithms: selection and insertion. Here is code for a third, which we're calling "Divvy Sort". (The swap function simply switches the values of the two parameters.) void DivvySort(vector & a) int n = a. size(); int count 0; for(int i = n/2; i > 0; i = i/2) { for (int j = i; j & a) int n = a. size(); int count 0; for(int i = n/2; i > 0; i = i/2) { for (int j = i; j