CS C++ Selection Sort Algorithm

You are asked to implement the selection sort for an array of integers and then perform the measurements as detailed below.

> For each algorithm, implement the functions that take an array of integers and the size of the array and then sort it in non-ascending (descending) order. Add two counters to count and return the number of key comparisons and the number of data moves during sorting.

> For key comparisons, you should count each comparison like k1

> For data moves, you should count each assignment as one move, where either the right-hand side of this assignment or its left-hand side or both of its sides correspond to the value of an array entry. For example, the following swap function has three such assignments (and thus three data moves):

** Just following these simple rules, please implement a selection sort algorithm in C++

void swap (DataType &x DataType&y) Datalype temp Xi x=y; y = temp