328 views
1 votes
1 votes

Consider an array ‘A’ of n distinct elements where value of elements lies from 1 to n. Array ‘A’ contains permutation of n elements. If we apply an operation  which of the following is correct?
(Assume both array of same size)

 (a)   Array ‘B’ will be sorted array.

(b)   A sorted permutation of array ‘A’ need not to give sorted array ‘B’.

(c)    Array ‘B’ is a permutation of array ‘A’

(d)  Doing the same permutation twice will not give the same array i.e., 

How can solve it ?

Please help 

Please log in or register to answer this question.

Related questions

2 votes
2 votes
3 answers
2
TusharKumar asked Dec 29, 2022
426 views
how does the program is working..?answer – 8
0 votes
0 votes
1 answer
3
0 votes
0 votes
1 answer
4
tishhaagrawal asked Dec 16, 2023
379 views
Below is my approach to solving this question, can anyone please explain if I am doing it the right way?Let X = #free slotssince, m =7 and n = 3So, $4 \leqslant x\leqsla...