Code in C++

you have a number x =< 30 and another number y =< 10^5. x is the number of vectors and y is the size of each vector which contains numbers from -10^7 to 10^8

for each vector Z[1 to y], output two different indices 1 =

You may use dynamic arrays or vectors. Input size will always change.

Perform asymptotic complexity analysis of the code

1. Characterize the function T(.) that would characterize the running time of code
2. Show big O, big omega, and big theta complexity of your algorithm

Sample input file

6 7

3 6 0 -3 8 3 6 7 4 3 3 2 8 1 5 8 4 0 -5 1 9 9 7 6 5 4 -4 8 1 5 5 2 6 9 3 8 1 -1 2 4 5 4

Sample output file

1 4

-1

1 5

5 6

-1

2 3