From a5ef4a76aeb8db703987fca051e09c109a076e39 Mon Sep 17 00:00:00 2001 From: Sai Chakradhar Rao Mahendrakar Date: Fri, 25 Jul 2025 16:44:53 +0530 Subject: [PATCH] add sai-chakradhar data in course3 --- Course3 | 3 +++ 1 file changed, 3 insertions(+) diff --git a/Course3 b/Course3 index 6ebe1c1f..e6399ecc 100644 --- a/Course3 +++ b/Course3 @@ -9,3 +9,6 @@ Pawan Dubey Dynamic Programming Understanding the prolem and implementing a solution which is space and time efficient by structuring it into sub problems. +Sai Chakradhar Rao Mahendrakar +Divide and Conquer Algorithms +Divide and conquer is an algorithmic technique that breaks a problem into smaller subproblems, solves each recursively, and then combines their solutions. This approach simplifies complex problems and often leads to more efficient algorithms, such as Merge Sort and Quick Sort.