I have this problem:
You are given an array called source, with length n, and a set of m arrays called target, each also
with length n. The arrays contain only positive integers. The arrays are unsorted. For any number
x, the smallest number in target[x] is guaranteed to be smaller than target[x+1]. All the numbers in
target are unique. The following figure illustrates an example of valid source and target arrays for
this case, where n=5 and m=6.
source = [14, 13, 15, 11, 12] target[0] = [4, 2, 1, 3, 5]
target[1] = [6, 8, 7, 10, 9]
target[2] = [14, 15, 12, 11, 13]
target[3] = [17, 20, 16, 18, 19]
target[4] = [22, 21, 24, 23, 25]
target[5] = [30, 29, 28, 27, 26]
The smallest number in each array in target is styled with bold and italic. You can quickly see that
the smallest number in target[0] is smaller than the smallest number in target[1], the smallest
number in target[1] is smaller than the smallest number in target[2], and so on. You can also see
that there is no duplicate number within the arrays in target. You are asked to design an algorithm
to find if there is an array in b that has the same set of numbers as in a. In the above case, your
algorithm should return true, because b[2] has the same set of numbers as in a.
a. Propose an algorithm to solve the case. Explain the algorithm in detail. (40%)
b. Calculate and express the time complexity of your algorithm in n and m. Explain in detail why
your algorithm has the time complexity you have calculated. (40%)
c. Write down the pseudocode of your proposed algorithm. (20%)
And I know that I the quickest way to solve it is to take the smallest number in the source and the targets array, and then compare the smallest number of the source to the smallest number of the targets. If the smallest number in source is in a target then compare the whole array.
The problem is I don't really get how to make the pseudocode let alone count the time complexity. Please help me out.