And the first one we're going to focus on is called the Divide and Conquer algorithm design paradigm.

You don't need to know say, the divide and conquer paradigm, if all you need to do is sort 100 numbers.

On the design side, we'll get more experience applying the divide and conquer paradigm to further problems. See you then.

Conquer your desktop!

To conquer a history for myself.

What makes it, if anything, better than much simpler non divide and conquer algorithms, like say, insertion sort?

I shall conquer this.

My wish is to conquer this mountain.

You should try to conquer your smoking habit.

I don't want to rule or conquer anyone.

Okay? So we'll get a win, first sorting in Divide and Conquer, and Merge Sort is the algorithm that realizes that benefit.

In this state nothing is going to conquer you.

I will conquer the new America.

Alexander the Great went on to conquer the known world

We all thought then that somebody wanted to conquer us.

In English, fear is something we conquer.

How can the god conquer his doubts?

They made it possible for me to conquer the Emerald City.

We're asked to divide.

You must conquer your fear of the dark.

You must conquer your fear of the dark.

And that Our forces, they surely must conquer.

To divide it by 100, we have to divide it by 10 again.

Divide

Divide.

And it will allow us to analyze lots of different recursive algorithms, lots of different Divide and Conquer algorithms, including the integer multiplication algorithm that we discussed in an earlier segment.

And a year after that, we did conquer it.

Conquer your fear and claim the treasure you seek.

We're gonna conquer, and we're gonna kick some. Understood?

The idea of divide and conquer is that you can break a problem into roughly equal size sub problems, solve the sub problems separately, and combine the results.

Lack of money is a serious hindrance in their fight to conquer cancer.

If all you need to do is sort arrays of size 1500 you really don't need to know Divide and conquer or anything else we'll talk about that's a pretty trivial problem on modern computers.

You need two numbers to divide

I'm going to divide it into

And I want to divide that by, I don't know, let's divide it by,

In the upcoming lectures I'll provide you with the tools to not only precisely understand and answer this question but more generally to predict the running times of an entire genre of divide and conquer algorithms, like

In the neighbouring land. But having been conquered they will conquer

It was evident that their battle cry was Conquer or die.

The day will soon come when we will conquer space and travel to the moon.

So we're going to divide by 4.

So we're going to divide by 3.

We need to divide 0.25 into 1.03075.

But we want to divide by 100.

We're going to divide it into two.

I'm going to divide 8 into 7.