Chevron Left
返回到 Divide and Conquer, Sorting and Searching, and Randomized Algorithms

学生对 斯坦福大学 提供的 Divide and Conquer, Sorting and Searching, and Randomized Algorithms 的评价和反馈

4.8
4,998 个评分

课程概述

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)....

热门审阅

KS

Sep 13, 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.

DT

May 26, 2020

Thank you for teaching me this course. I learned a lot of new things, including Divide-and-Conquer, MergeSort, QuickSort, and Randomization Algorithms, along with proof for their asymptotic runtime

筛选依据:

1 - Divide and Conquer, Sorting and Searching, and Randomized Algorithms 的 25 个评论(共 953 个)

创建者 Thomas N

Feb 9, 2019

创建者 Divij S

Jan 23, 2018

创建者 Ian D

Jan 3, 2019

创建者 Erin H

Jun 19, 2018

创建者 Joshua S

Oct 3, 2018

创建者 Bakhtiar R

Nov 3, 2017

创建者 Bharath K N

Oct 16, 2018

创建者 Pablo S

Dec 30, 2019

创建者 Amit

Nov 2, 2016

创建者 Vladimir M

Oct 18, 2019

创建者 Jyovita C

Jun 11, 2017

创建者 LUIZ O V L D G

Oct 1, 2019

创建者 Matthieu D

Sep 13, 2018

创建者 Adam L

Jun 11, 2017

创建者 Pulkit K

Jun 11, 2018

创建者 Faiz R

Mar 16, 2017

创建者 Wang Q

Dec 13, 2020

创建者 Maxim A

Apr 9, 2021

创建者 Z T

Oct 2, 2020

创建者 Sandeep P

Aug 6, 2018

创建者 Karan S

Sep 14, 2018

创建者 Sergey S

Mar 25, 2019

创建者 Cole C

Jan 14, 2021

创建者 abusaleh i

Mar 14, 2019

创建者 Sergey T

May 3, 2020