Please Use C++ Language.
And Note that please donot post the answer already there Because there is similar answer code but I need with modified Quick sort algorithm ?
Update your program from ... Create an array that holds 1000 random integers between 1-1000. Allow the user to enter an integer to search.
Create and implement modified Quick sort algorithm which will sort the array before the Binary Search algorithm is executed. Create and implement a Binary Search Algorithm .
If the number exists in the array and output the position.
If the search key does not exist in the Array simple output value not found. Use the clock(); method to time the execution of the search and sort Execute the program 3 times.
Twice running the modified Quick sort as the sorting algorithm. Describe your results in relation to "Create and implement modified bubble sort algorithm which will sort the array before the Binary Search algorithm is executed.
Create and implement Insertion sort algorithm which will sort the array before the Binary Search algorithm is executed.", the insertion sort and the bubble sort.