fix learning objectives week 3.

docs/03-divide-and-conquer/divide-and-conquer.md

@@ -17,11 +17,15 @@ Recursion is a programming technique in which a function calls itself to solve a
 
 By the end of this lesson, you should be able to:
 
-- Solve problems using **recursion**
-- Identify problems that has recursive solutions
+- Solve problems using **recursion**.
+- Identify problems that has recursive solutions.
+- Identify **base case** and **recursive case** in a recursive problem and its solution.
+- Explain and implement the recursive solution of **Tower of Hanoi**.
+- Derive solution for **recurrence** of Tower of Hanoi using **recursion-tree** method.
+
 
 :::keyword Keywords
-`recursion`, `base case`, `recursive case`, `helper function`, `recursive tree`
+`recursion`, `base case`, `recursive case`, `recursion tree`
 :::
 
 ## Introduction

docs/03-divide-and-conquer/merge-sort.md

@@ -16,9 +16,9 @@ Merge Sort is another sorting algorithm that implements the principle of divide
 
 By the end of this lesson, you should be able to:
 
-- Explain and implement **merge sort** algorithm
-- Derive solution of **recurrence** of merge sort using recursion-tree method
-- Measure computation time of merge sort and **compare** it with the other sort algorithms
+- Explain and implement **merge sort** algorithm.
+- Derive solution of **recurrence** of merge sort using **recursion-tree** method.
+- Measure computation time of merge sort and **compare** it with the other sort algorithms.
 
 :::keyword Keywords
 `sorting`, `mergesort`, `log linear time complexity`

learning-objectives/intro.md

@@ -46,12 +46,12 @@ By the end of these lessons, students should be able to:
 
 - Solve problems using **recursion**.
 - Identify problems that has recursive solutions.
-- Identify base case and recursive case in a recursive problem and its solution.
-- Explain and implement the recursive solution of Tower of Hanoi.
+- Identify **base case** and **recursive case** in a recursive problem and its solution.
+- Explain and implement the recursive solution of **Tower of Hanoi**.
 - Explain and implement **merge sort** algorithm.
-- Derive solution for **recurrence** of tower of hanoi and merge sort using recursion-tree method.
-- Measure computation time of merge sort and **compare** it with the other sort algorithms.
-- Use helper function for a recursive solution.
+- Derive solution for **recurrence** of tower of hanoi and merge sort using **recursion-tree** method.
+- Measure **computation time** of merge sort and compare it with the other sort algorithms.
+- Use **helper function** for a recursive solution.
 - Compare recursive solution with that using iteration and discuss its advantages and disadvantages.
 
 ## Week 4: Object-Oriented Paradigm