a. Create the vector via an initialization list.
b. Provide the length of the vector using the sizeof() function.
c. Create a function printVector() to visualize the vectors. This function is the same as the one studied in the lectures but it has to be done using POINTERS.
d. Inside your sorting there is a group of three statements that switches the positions under comparison. They have to be moved to a new function named swap(), done with POINTERS.
e. Each sorting algorithm must be done with a function and they don’t need to be implemented with pointers.
This is how you will display the results:
a. Create a second vector identical to the original,
b. Print either vector,
c. Execute MaRe on the original vector,
d. Print the sorted original vector,
e. Execute MiCo on the second vector,
f. Print the sorted second vector.s how you will display the results:
Please help me if you understand because I am confused and don't understand thanks!
