1 1 vote Let $A$ and $B$ be two arrays of size $n$, each containing the numbers $\{1,2, \ldots, n\}$ in some order. The operations allowed on the entries of the arrays are comparisons between two entries and swapping two entries. Consider the best possible algorithm to transform the array $A$ to array $B$ using the above two operations only. The total number of operations in which the above algorithm can perform this task in the worst case isa constant$n$$n$ !none of these Algorithms isi2024-mcs-pca data-structures algorithms array + – Ay_Kay_Ay 241 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.