Divide and Conquer Algorithms

Offered byGreat Learning

Divide and Conquer Algorithms
at
Great Learning
Overview

Duration	1 hour
Total fee	Free
Mode of learning	Online
Difficulty level	Beginner
Official Website	Explore Free Course
Credential	Certificate

Divide and Conquer Algorithms
at
Great Learning
Highlights

Earn a certificate of completion

Divide and Conquer Algorithms
at
Great Learning
Course details

What are the course deliverables?

Divide and Conquer Algorithms

More about this course

In this course, we'll start by understanding the concept of divide and conquer, i.e., how a problem can be divided into two or more sub-problems of the same type
We will also look at why it's required and the different steps involved in it: divide, conquer and combine
The first type of algorithm that we'll look into is Binary Search
We'll understand the concept of Binary Search, post which we will understand the algorithm along with a demonstration, its implementation and time & space complexity, and then understand how this algorithm falls under the divide and conquer paradigm
Following this, we will also learn about Quick Sort and Merge Sort algorithms
We will understand their concepts, algorithm, demonstration, implementation, time complexity, space complexity and then understand how these algorithms also fall under the divide and conquer model

Divide and Conquer Algorithms
at
Great Learning
Curriculum

Introduction To Algorithm

What is Binary Search?

Binary Search Iterative Algorithm

Binary Search Demostration

What is Quick Sort?

Quick Sort Algorithm

Divide and Conquer Algorithms
at
Great Learning
Faculty details

Mr. Faizan Parvez

Designation : Instructor Description : Faizan has been working as an Instructor of Data Structure and Algorithm for the last 1 year. He has expertise in languages such as Java , JavaScript etc. He is a Subject Matter Expert in the field Computer Science and a competitive programmer. He has been working in the technical content development and is a Research Analyst .