|
所在平台: CourseraArchive 课程类别: 计算机科学 大学或机构: CourseraNew |
课程主页: https://www.coursera.org/archive/algorithms-divide-conquer
课程评论：没有评论
Stanford University
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).
