diff --git a/README.md b/README.md
index 7f51a4d..817f1ee 100644
--- a/README.md
+++ b/README.md
@@ -46,7 +46,7 @@
 ## Algorithm Theory
 
 - [`course`](https://www.youtube.com/playlist?list=PLOtl7M3yp-DXbHTFe_w9zFPXeau28CDao) [`book`](https://mimoza.marmara.edu.tr/~msakalli/cse706_12/SkienaTheAlgorithmDesignManual.pdf) [`code`](https://www.algorist.com/) **CSE373 - Analysis of Algorithms** - Taught by Prof. Steven Skiena. He covers topic such as data structure, searching and sorting algorithms, shortest-path algorithms, dynamic programming, and NP-Completeness.
-- [`course`](https://see.stanford.edu/Course/CS106B) **CS106B - Programming Abstractions** - Stanford Engineering Everywhere: Object-oriented programming, fundamental data structures (such as stacks, queues, sets) and data-directed design. Recursion and recursive data structures (linked lists, trees, graphs). Introduction to time and space complexity analysis. Uses the programming language C++ covering its basic facilities.
+- [`course`](https://see.stanford.edu/Course/CS106B) **CS106B - Programming Abstractions** - Stanford Engineering Everywhere: Object-oriented programming, fundamental data structures (such as stacks, queues, sets) and data-directed design. Recursion and recursive data structures (linked lists, trees, graphs). Introduction to time and space complexity analysis. It uses the C++ programming language covering its basic facilities.
 - [`book`](https://github.com/calvint/AlgorithmsOneProblems/blob/master/Algorithms/Thomas%20H.%20Cormen,%20Charles%20E.%20Leiserson,%20Ronald%20L.%20Rivest,%20Clifford%20Stein%20Introduction%20to%20Algorithms,%20Third%20Edition%20%202009.pdf) [`code`](https://github.com/pl3onasm/CLRS/) - **Introduction to Algorithms. Thomas H. Cormen, Charles E. Leiserson, Ronald L** - C Implementation of all the algorithms and data structures discussed in the textbook Introduction to Algorithms by Thomas H. Cormen, et al.
 - [`reading`](https://www.teach.cs.toronto.edu/~csc110y/fall/notes/) **Foundations of Computer Science** - Course Notes for CSC110 and CSC111: Propositional Logic; Big-O, Omega, Theta; Data Types, Abstract and Concrete; Linked Lists; Induction and Recursion; Trees; Graphs; Sorting.
 - [`video`](https://www.youtube.com/watch?v=A60q6dcoCjw) **The hidden beauty of the A\* algorithm.**