Join the social network of Tech Nerds, increase skill rank, get work, manage projects...
 
Node is saved as draft in My Content >> Draft

  • Divide and Conquer approach in C

    @HIMANSHU
    Recommendations Offline Message

    • 0
    • 0
    • 0
    • 0
    • 0
    • 0
    • 0
    • 0
    • 41
    Comment on it

    In divide and conquer approach the problem is subdivided into smaller problems, and then the sub problems we solved one by one and then they are integrated at last.

     

    Divide and Conquer

     

    Broadly, we can expand it into a three way process:

     

    Divide/Break

    It is the process of breaking the problems into the subproblems so that subproblems are solved independently

     

     

    Conquer/Solve

     

    Then the subproblems are solved one by one or in parallel

     

    Merge/Combine

     

    After solving all the subproblems we merge it into the single solution at last

     

     

    Examples

    The following computer algorithms are based on divide-and-conquer programming approach −

    • Merge Sort
    • Quick Sort
    • Binary Search
    • Strassen's Matrix Multiplication
    • Closest pair (points)

     

    .net
    Comment on it

 0 Comment(s)

Sign In
Forgot Password?
                           OR                           
Create an account !!
                           OR                           
Register

Sign up using

                           OR                           
Forgot Password
Fill out the form below and instructions to reset your password will be emailed to you:
Reset Password
Fill out the form below and reset your password: