I would help if It wasn’t so confusing.
Explanation:
are bhai brainly aap english me questions kar ne ko hai
ye kon si bhasha hai ??????
Answer:
Using the above algorithm matches one pair of Ghostbuster and Ghost. On each side of the line formed by the pairing, the number of Ghostbusters and Ghosts are the same, so use the algorithm recursively on each side of the line to find pairings. The worst case is when, after each iteration, one side of the line contains no Ghostbusters or Ghosts. Then, we need n/2 total iterations to find pairings, giving us an P(
)- time algorithm.
Answer:
Explanation:
The step by step analysis is as shown in the attached files.