void selection_sort(int *a, int n); int *find_largest(int *a, int n); void swap(int *p, int *q); selection_sort function: it should call find_largest function and swap function. find_largest function: when passed an array of length n, the function will return a pointer to the array’s largest element. The function should use pointer arithmetic – not sub-scripting – to visit array elements. In other words, eliminate the loop index variables and all use of the  operator in the function. swap function: when passed the addresses of two variables, the function should exchange the values of the variables: swap(&i, &j); /* exchange values of i and j */
Be advised that this service is completely legal and does not infringe any college/university law. The paper received from our company may be used as a source for a deeper comprehension on the subject.
WEBSITE LIVE CHAT:
Any Given Deadline