Update README.md

Author: SSQ

README.md

@@ -3,15 +3,16 @@
 Course can be found [here](https://www.coursera.org/learn/algorithms-divide-conquer)
 
 Notebook for quick search can be found [here](https://ssq.github.io/2017/07/17/Coursera%20S%20Algorithms%20Specialization%20Notebook/)
-Week 1 Lecture slides:
-- 1: Divide and Conquer:
- - [Integer Multiplication](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/1.2-algo1-intro2_typed.pdf);
- - [Karatsuba Multiplication](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/1.3-algo1-intro3_typed.pdf);
- - [Implementation](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/tree/master/Programming%20Assignment%201) by Python;
- - [Merge Sort](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/1.6-slides_algo-merge2_typed.pdf).
-- 2: Asymptotic Analysis:
- - [Big-oh notation](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/2.2-slides_algo-asymptotic1_typed.pdf);
- - [Omega and Theta notation](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/2.4-slides_algo-asymptotic3_typed.pdf);
+
+- Week 1 Lecture slides:
+ - 1: Divide and Conquer:
+ - [Integer Multiplication](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/1.2-algo1-intro2_typed.pdf);
+ - [Karatsuba Multiplication](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/1.3-algo1-intro3_typed.pdf);
+ - [Implementation](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/tree/master/Programming%20Assignment%201) by Python;
+ - [Merge Sort](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/1.6-slides_algo-merge2_typed.pdf).
+ - 2: Asymptotic Analysis:
+ - [Big-oh notation](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/2.2-slides_algo-asymptotic1_typed.pdf);
+ - [Omega and Theta notation](https://github.com/SSQ/Coursera-Stanford-Divide-and-Conquer-Sorting-and-Searching-and-Randomized-Algorithms/blob/master/Lecture%20Slides/2.4-slides_algo-asymptotic3_typed.pdf);
 
 - Week 2: