When an algorithm breaks a problem into sub-problems, solves a single sub-problem and merges the solutions _____?
When an algorithm breaks a problem into sub-problems, solves a single sub-problem and merges the solutions _____?
جب کوئی الگورتھم کسی مسئلے کو ذیلی پریشانیوں میں توڑ دیتا ہے تو ، ایک واحد ذیلی مسئلہ حل کرتا ہے اور حل _____ کو ضم کرتا ہے؟
Explanation
Divide and Conquer works by dividing a problem into smaller sub-problems, solving them, and then combining the results.
Famous examples include Merge Sort and Quick Sort.