Please enable JavaScript.

Coggle requires JavaScript to display documents.

Divide-and-Conquer - Coggle Diagram

- - - - A[0..n/2(floor) − 1]
      - A[n/2(floor)..n − 1]
      - Sort each of them recursively
        
        Merge the two smaller sorted arrays into a single sorted one
  - - - C(n) = 2C(n/2) + Cmerge(n) for n > 1, C(1) = 0.
- - - - Divide the problem into two instances of the same
        problem
        
        Compute the sum of the first n/2(floor) numbers
        
        Compute the sum
        of the remaining n/2(Ceil) numbers
        
        Each of these two sums is computed by applying the same method
        recursively
        
        Add the 2 values