课程信息
4.8
2,022 个评分
398 个审阅
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)....
Stacks

Course 1 of 4 in the

Globe

100% 在线课程

立即开始,按照自己的计划学习。
Calendar

可灵活调整截止日期

根据您的日程表重置截止日期。
Intermediate Level

中级

Clock

Approx. 20 hours to complete

建议:4 weeks of study, 4-8 hours/week...
Comment Dots

English

字幕:English...

您将获得的技能

AlgorithmsRandomized AlgorithmSorting AlgorithmDivide And Conquer Algorithms
Stacks

Course 1 of 4 in the

Globe

100% 在线课程

立即开始,按照自己的计划学习。
Calendar

可灵活调整截止日期

根据您的日程表重置截止日期。
Intermediate Level

中级

Clock

Approx. 20 hours to complete

建议:4 weeks of study, 4-8 hours/week...
Comment Dots

English

字幕:English...

教学大纲 - 您将从这门课程中学到什么

Week
1
Clock
完成时间为 3 小时

Week 1

Introduction; "big-oh" notation and asymptotic analysis....
Reading
13 个视频(共 130 分钟), 3 个阅读材料, 2 个测验
Video13 个视频
Integer Multiplication8分钟
Karatsuba Multiplication12分钟
About the Course17分钟
Merge Sort: Motivation and Example8分钟
Merge Sort: Pseudocode12分钟
Merge Sort: Analysis9分钟
Guiding Principles for Analysis of Algorithms15分钟
The Gist14分钟
Big-Oh Notation4分钟
Basic Examples7分钟
Big Omega and Theta7分钟
Additional Examples [Review - Optional]7分钟
Reading3 个阅读材料
Welcome and Week 1 Overview10分钟
Overview, Resources, and Policies10分钟
Lecture slides10分钟
Quiz2 个练习
Problem Set #110分钟
Programming Assignment #12分钟
Week
2
Clock
完成时间为 3 小时

Week 2

Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms....
Reading
11 个视频(共 170 分钟), 2 个阅读材料, 2 个测验
Video11 个视频
O(n log n) Algorithm for Counting Inversions II16分钟
Strassen's Subcubic Matrix Multiplication Algorithm22分钟
O(n log n) Algorithm for Closest Pair I [Advanced - Optional]31分钟
O(n log n) Algorithm for Closest Pair II [Advanced - Optional]18分钟
Motivation7分钟
Formal Statement10分钟
Examples13分钟
Proof I9分钟
Interpretation of the 3 Cases10分钟
Proof II16分钟
Reading2 个阅读材料
Week 2 Overview10分钟
Optional Theory Problems (Batch #1)10分钟
Quiz2 个练习
Problem Set #210分钟
Programming Assignment #22分钟
Week
3
Clock
完成时间为 3 小时

Week 3

The QuickSort algorithm and its analysis; probability review....
Reading
9 个视频(共 156 分钟), 1 个阅读材料, 2 个测验
Video9 个视频
Partitioning Around a Pivot24分钟
Correctness of Quicksort [Review - Optional]10分钟
Choosing a Good Pivot22分钟
Analysis I: A Decomposition Principle21分钟
Analysis II: The Key Insight11分钟
Analysis III: Final Calculations8分钟
Probability Review I25分钟
Probability Review II17分钟
Reading1 个阅读材料
Week 3 Overview10分钟
Quiz2 个练习
Problem Set #310分钟
Programming Assignment #36分钟
Week
4
Clock
完成时间为 4 小时

Week 4

Linear-time selection; graphs, cuts, and the contraction algorithm....
Reading
11 个视频(共 184 分钟), 3 个阅读材料, 3 个测验
Video11 个视频
Randomized Selection - Analysis20分钟
Deterministic Selection - Algorithm [Advanced - Optional]16分钟
Deterministic Selection - Analysis I [Advanced - Optional]22分钟
Deterministic Selection - Analysis II [Advanced - Optional]12分钟
Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional]13分钟
Graphs and Minimum Cuts15分钟
Graph Representations14分钟
Random Contraction Algorithm8分钟
Analysis of Contraction Algorithm30分钟
Counting Minimum Cuts7分钟
Reading3 个阅读材料
Week 4 Overview10分钟
Optional Theory Problems (Batch #2)10分钟
Info and FAQ for final exam10分钟
Quiz3 个练习
Problem Set #410分钟
Programming Assignment #42分钟
Final Exam20分钟
4.8
Direction Signs

24%

完成这些课程后已开始新的职业生涯
Briefcase

83%

通过此课程获得实实在在的工作福利
Money

20%

加薪或升职

热门审阅

创建者 KSSep 14th 2018

Well researched. Topics covered well, with walkthrough for exam.le cases for each new introduced algorithm. Great experience, learned a lot of important algorithms and algorithmic thinking practices.

创建者 FRMar 16th 2017

Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec

讲师

Tim Roughgarden

Professor
Computer Science

关于 Stanford University

The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States....

关于 Algorithms 专项课程

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists. About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications....
Algorithms

常见问题

  • Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.

  • When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.

还有其他问题吗?请访问 学生帮助中心