Welcome To Tutorialspoint.dev
Officially launched 18th May 2019

# Divide and Conquer Algorithm Introduction

Like Greedy and Dynamic Programming, Divide and Conquer is an algorithmic paradigm. A typical Divide and Conquer algorithm solves a problem using following three ste...

# Divide and Conquer

1 Divide and Conquer Please wait while the activity loads. If this activity does not load, t...

# Tiling Problem using Divide and Conquer algorithm

Given a n by n board where n is of form 2k where k &gt;= 1 (Basically n is a power of 2 with minimum value as 2). The board has one missing cell (of size 1 x 1). Fill...

# Divide and Conquer Set 5 (Strassen’s Matrix Multiplication)

Given two square matrices A and B of size n x n each, find their multiplication matrix. Naive Method Following is a simple way to multiply two matrices. ...

# Divide and Conquer Algorithm Introduction

Like Greedy and Dynamic Programming, Divide and Conquer is an algorithmic paradigm. A typical Divide and Conquer algorithm solves a problem using following three ste...

# Longest Common Prefix using Divide and Conquer Algorithm

Given a set of strings, find the longest common prefix. Examples: Input : {&#x201C;geeksforgeeks&#x201D;, &#x201C;geeks&#x201D;, &#x201C;geek&#x201D;, &#x201C;geezer...

# Search in a Row-wise and Column-wise Sorted 2D Array using Divide and Conquer algorithm

Given an n x n matrix, where every row and column is sorted in increasing order. Given a key, how to decide whether this key is in the matrix. A linear time complexi...

# Karatsuba algorithm for fast multiplication using Divide and Conquer algorithm

Given two binary strings that represent value of two integers, find the product of two strings. For example, if the first bit string is &#x201C;1100&#x201D; and secon...

# Maximum Subarray Sum using Divide and Conquer algorithm

You are given a one dimensional array that may contain both positive and negative integers, find the sum of contiguous subarray of numbers which has the largest sum....

# The Skyline Problem using Divide and Conquer algorithm

Given n rectangular buildings in a 2-dimensional city, computes the skyline of these buildings, eliminating hidden lines. The main task is to view buildings from a si...