Algorithms, Part I
Learn
College :
通識教育中心
Department :
一般通識組
Credits :
2.0
GE Field :
科學與邏輯思維
Platform :
Coursera特許無證書課程
University :
Princeton University
Instructors :
Kevin Wayne, Robert Sedgewick
Language :
英文
Peer Review
  • 4Content
  • 4Match
  • 4Total
4/5
    推薦留言共 10 則
  • 超級爆幹難的 至少要精通java語言才能來學 2/14/2026 5:55:14 PM
  • 需要有一點程式基礎,課程內容為英文。有點挑戰性 10/27/2025 10:51:58 PM
  • 有點挑戰 9/12/2025 8:30:39 PM
  • 沒基礎學的超痛苦,但為了畢業門檻咬牙硬撐🤡 6/13/2025 10:58:31 PM
  • 可以學到很多 3/29/2025 4:05:55 PM
  • 可以得到很多知識 3/27/2025 11:32:43 AM
  • 實用 3/20/2025 3:42:40 AM
  • 有點難 2/28/2025 10:38:06 PM
  • 內容成漸進式設計,讓學員能夠從基礎逐漸延伸到進階內容;每堂課均有練習機會並附題目說明,我覺得很棒~ 10/23/2024 12:46:41 PM
  • 老師解釋十分清楚,作業也能非常好的練習到知識點 9/10/2024 3:26:47 PM
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.
    同名課程…