consider you are having a necklace with 11 bid of peari.The pearls are having blue and white colors alternatively. The is option for the time being that if you do not like any particular peari you can take off. assume the pearl at the middle is not liked by you and you want to replace it by a dark red jewel! which data structure is appropriate to handle the aforesaid scenario.write a program in c to implement the data structure in general and then perform those specific takes later through programming.
Answers
Answered by
0
Answer:
After fixing the places of three pearls.
Treating 3 specific pearls = 1 unit, so we have now 18 pearls+1 unit= 19 and the number of arrangement will be (19−1)!=18!
Also, the number of ways of 3 pearls can be arranged between themselves is 3!=6.
Since, there is no distinction between the clockwise and anticlockwise arrangements.
So, the required number of arrangements
=2118!.6=3(18!).
Similar questions