Recursion in C++ - Binary Search - Computer Science Assessment Answer

Assessment Task:

This is a programming contest type of problem-solving problem. In computer science, binary search is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the remaining half, again taking the middle element to compare to the target value, and repeating this until the target value is found. If the search ends with the remaining half being empty, the target is not in the array. 
I. Write a recursive function with the following function declaration 
int binary_search(int val, int list[], int low, int high); 
which searches the values in the "list[]" array from "list[low]" to "list[high]" to find an array element with value "val". If it finds "val", it returns the position of "val" in the "list[]". Otherwise it returns -1.  
II. As binary search works only on a sorted array, you are required to write a recursive quicksort function to sort the elements of the array before performing a binary search.   The declaration of this function is as follows: 
void quick_sort(int list[MAX], int low, int high); 
III. Test your functions in a suitable main program. You are required to enter the elements of the array of arbitrary size and search for an element in the array using a recursive binary search algorithm.

This Computer Science Assessment has been solved by our Computer Science Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.