Divide and Conquer, Sorting and Looking out, and Randomized Algorithms

About this Course

The first matters on this a part of the specialization are: asymptotic (“Large-oh”) notation, sorting and looking out, divide and conquer (grasp methodology, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).

SKILLS YOU WILL GAIN

• Algorithms
• Randomized Algorithm
• Sorting Algorithm
• Divide And Conquer Algorithms

Syllabus – What you’ll be taught from this course

Content material Ranking94%(16,438 scores)

WEEK

1

4 hours to finish

Week 1

Introduction; “big-oh” notation and asymptotic evaluation.

WEEK

2

4 hours to finish

Week 2

Divide-and-conquer fundamentals; the grasp methodology for analyzing divide and conquer algorithms.

WEEK

3

4 hours to finish

Week 3

The QuickSort algorithm and its evaluation; chance overview.

WEEK

4

5 hours to finish

Week 4

Linear-time choice; graphs, cuts, and the contraction algorithm.