Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Course
en
English
16 h
This content is rated 0 out of 5
Source
  • From www.coursera.org
Conditions
  • Self-paced
  • Free Access
  • Fee-based Certificate
More info
  • 4 Sequences
  • Intermediate Level

Their employees are learning daily with Edflex

  • Safran
  • Air France
  • TotalEnergies
  • Generali
Learn more

Course details

Syllabus

  • Week 1 - Week 1
    Introduction; "big-oh" notation and asymptotic analysis.
  • Week 2 - Week 2
    Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
  • Week 3 - Week 3
    The QuickSort algorithm and its analysis; probability review.
  • Week 4 - Week 4
    Linear-time selection; graphs, cuts, and the contraction algorithm.

Prerequisite

None.

Instructors

Tim Roughgarden
Professor
Computer Science

Editor

Leland Stanford Junior University, better known as Stanford University, is a private American university located in Silicon Valley, south of San Francisco.

Its motto is "Die Luft der Freiheit weht", which means "The wind of freedom blows".

Ranked among the world's top universities in most international rankings, it enjoys great prestige.

Platform

Coursera is a digital company offering massive open online course founded by computer teachers Andrew Ng and Daphne Koller Stanford University, located in Mountain View, California. 

Coursera works with top universities and organizations to make some of their courses available online, and offers courses in many subjects, including: physics, engineering, humanities, medicine, biology, social sciences, mathematics, business, computer science, digital marketing, data science, and other subjects.

This content is rated 4.5 out of 5
(no review)

What did you think of this course?

Complete this resource to write a review