Please help someone I am stuck in this C++ program. God bless you..please please help.

Algorithm program::

Search the index, k of an element x in the array S of n elements, n < 1001(size of the array), S[1..n]. If x is not in S, then return -1. The program should array size by the random array. Implement the sequential search and the binary search algorithms and conduct the average case analysis for an ordered array. For your experiment for time complexity, count the number of comparison operations in your program.

Please provide the C++ code for this program. And pls don't provide the pseudo code. pls provide the whole program from starting to end with output screeshot. please please help