From c29efb2fdfa977de865afc0d2b508a14c07e1c83 Mon Sep 17 00:00:00 2001 From: Meisterlala <6453306+Meisterlala@users.noreply.github.com> Date: Sun, 15 Aug 2021 21:07:32 +0200 Subject: [PATCH] Fixed Links --- Algorithms Specialization/Part 2/README.md | 1 + Algorithms Specialization/Part 3/README.md | 1 + Algorithms Specialization/Part 4/README.md | 1 + Algorithms Specialization/README.md | 8 ++++---- README.md | 4 ++-- 5 files changed, 9 insertions(+), 6 deletions(-) create mode 100644 Algorithms Specialization/Part 2/README.md create mode 100644 Algorithms Specialization/Part 3/README.md create mode 100644 Algorithms Specialization/Part 4/README.md diff --git a/Algorithms Specialization/Part 2/README.md b/Algorithms Specialization/Part 2/README.md new file mode 100644 index 0000000..7b4d68d --- /dev/null +++ b/Algorithms Specialization/Part 2/README.md @@ -0,0 +1 @@ +empty \ No newline at end of file diff --git a/Algorithms Specialization/Part 3/README.md b/Algorithms Specialization/Part 3/README.md new file mode 100644 index 0000000..7b4d68d --- /dev/null +++ b/Algorithms Specialization/Part 3/README.md @@ -0,0 +1 @@ +empty \ No newline at end of file diff --git a/Algorithms Specialization/Part 4/README.md b/Algorithms Specialization/Part 4/README.md new file mode 100644 index 0000000..c6cac69 --- /dev/null +++ b/Algorithms Specialization/Part 4/README.md @@ -0,0 +1 @@ +empty diff --git a/Algorithms Specialization/README.md b/Algorithms Specialization/README.md index c131f47..f9bcb3a 100644 --- a/Algorithms Specialization/README.md +++ b/Algorithms Specialization/README.md @@ -4,10 +4,10 @@ ### Synapse from the course description: Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists. -## [Divide and Conquer, Sorting and Searching, and Randomized Algorithms](Algorithms%20Specialization/Part%201/) +## [Divide and Conquer, Sorting and Searching, and Randomized Algorithms](Part%201/) -## [Graph Search, Shortest Paths, and Data Structures](Algorithms%20Specialization/Part%202/) +## [Graph Search, Shortest Paths, and Data Structures](Part%202/) -## [Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming](Algorithms%20Specialization/Part%203/) +## [Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming](Part%203/) -## [Shortest Paths Revisited, NP-Complete Problems and What To Do About Them](Algorithms%20Specialization/Part%204/) +## [Shortest Paths Revisited, NP-Complete Problems and What To Do About Them](Part%204/) diff --git a/README.md b/README.md index 1801fa6..45df400 100644 --- a/README.md +++ b/README.md @@ -10,12 +10,12 @@ Following the guide of: | Name | Course link | Date | | :---------------------------------------------- |:---------------------------------------------------------------- |-----------:| | [Calculus 1A: Differentiation][me11] | [edX / Massachusetts Institute of Technology][me12] | 17.06.2020 | -| Divide and Conquer, Sorting and Searching, and Randomized Algorithms | [Coursera / Stanford University][ct12] | 15.08.2021 | +| [Divide and Conquer, Sorting and Searching, and Randomized Algorithms][ct11] | [Coursera / Stanford University][ct12] | 15.08.2021 | [me11]: Calculus/1A%20Differentiation/ [me12]: https://www.edx.org/course/calculus-1a-differentiation - +[ct11]: Algorithms%20Specialization/Part%201/ [ct12]: https://www.coursera.org/learn/algorithms-divide-conquer -- 2.51.2