Skip to content

Commit 0b3b8cf

Browse files
authored
update week 3
1 parent 06db9d5 commit 0b3b8cf

File tree

1 file changed

+11
-1
lines changed

1 file changed

+11
-1
lines changed

README.md

Lines changed: 11 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -24,6 +24,16 @@ Notebook for quick search can be found [here](https://ssq.github.io/2017/07/17/C
2424
- [Motivation](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/4.1-slides_algo-master1_typed.pdf)
2525
- [Example](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/4.3-slides_algo-master3_typed.pdf)
2626
- [Proof I](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/4.4-slides_algo-master4_typed.pdf), [Proof II](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/4.6-slides_algo-master6_typed.pdf)
27-
- Week 3:
27+
28+
- Week 3 Lecture slides:
29+
- 5: Randomized Algorithm - QuickSort:
30+
- [Overview](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/5.1-slides_algo-qsort-intro_typed.pdf);
31+
- [The Partition Subroutine](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/5.2-slides_algo-qsort-partition_typed.pdf);
32+
- [Proof](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/5.3-slides_algo-qsort-correctness_typed.pdf);
33+
- [Choosing a Good Pivot](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/5.4-slides_algo-qsort-pivot_typed.pdf)
34+
- [Implementation of QuickSort](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/tree/master/Programming%20Assignment%203) with 3 pivots
35+
- 6: QuickSort Analysis:
36+
- [the average running time of QuickSort (with random pivots)](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/6.3-slides_algo-qsort-analysis3_typed.pdf)
37+
- 7: Probability Review:
2838

2939
- Week 4:

0 commit comments

Comments
 (0)