Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Learn
College :
通識教育中心
Department :
一般通識組
Credits :
1.0
GE Field :
科學與邏輯思維
Platform :
Coursera
University :
Stanford University
Instructors :
Tim Roughgarden
Language :
英文
Peer Review
  • 0Content
  • 0Match
  • 0Total
0/5
    推薦留言共 0 則
Course Goals
The primary topics in this part of the specialization are: asymptotic (""Big-oh"") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort , contraction algorithm for min cuts).
Course Syllebus
1. Introduction; "big-oh" notation and asymptotic analysis.
2. Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
3. The QuickSort algorithm and its analysis; probability review.
4. Linear-time selection; graphs, cuts, and the contraction algorithm.
Other Info.