Question
Which of the following algorithms is a classic example
of the Divide and Conquer paradigm?Solution
Merge Sort exemplifies Divide and Conquer: Â Â Â Â Divide: It divides the unsorted list into 'N' sublists, each containing one element (a list of one element is considered sorted). Â Â Â Â Conquer: It repeatedly merges sublists to produce new sorted sublists until there is only one sorted list remaining. Â Â Â Â Combine: The merging process combines the sorted sublists.
Find out the alternative figure which contains figure (X) as its part.
From the given answer figures, select the one in which the question figure is hidden/embedded.
Find out the alternative figure which contains the given figure as its part.
Choose the correct mirror image of the given figure (X) from amongst the four alternatives.
From the given answer figure select the one in which the question figure is hidden/embedded in the same direction.
Select the option in which figure is embedded.
From the given answer figures, select the one in which the question figure is hidden/ embedded.
From the given answer figure select the one in which the question figure is hidden/embedded in the same direction.
