c++, quicksort

Create an array that holds 1000 random integers between 1-1000.

Allow the user to enter an integer to search.

Create and implement Quicksort 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.

Attach Photos of Source Code and Output