From 51d00a040ca6481f49f45accf54f3b58f594e100 Mon Sep 17 00:00:00 2001 From: Reborn <92050163+HReborn@users.noreply.github.com> Date: Sun, 29 Sep 2024 17:29:40 -0300 Subject: [PATCH] Progress updated --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 5a74452..c7a04c3 100644 --- a/README.md +++ b/README.md @@ -136,7 +136,7 @@ If you've never written a for-loop, or don't know what a string is in programmin Completed | Courses | Duration | Effort | Prerequisites | Discussion :--: | :-- | :--: | :--: | :--: | :--: - ✅ | [Introduction to programming](coursepages/intro-programming/README.md) | 10 weeks | 10 hours/week | none | [chat](https://discord.gg/syA242Z) +❌ | [Introduction to programming](coursepages/intro-programming/README.md) | 10 weeks | 10 hours/week | none | [chat](https://discord.gg/syA242Z) ### Introduction to Computer Science @@ -256,7 +256,7 @@ Completed | Courses | Duration | Effort | Prerequisites | Discussion Completed | Courses | Duration | Effort | Prerequisites | Discussion :--: | :-- | :--: | :--: | :--: | :--: -❌ | [Divide and Conquer, Sorting and Searching, and Randomized Algorithms](https://www.coursera.org/learn/algorithms-divide-conquer) | 4 weeks | 4-8 hours/week | any programming language, Mathematics for Computer Science | [chat](https://discord.gg/mKRS7tY) +🕒 | [Divide and Conquer, Sorting and Searching, and Randomized Algorithms](https://www.coursera.org/learn/algorithms-divide-conquer) | 4 weeks | 4-8 hours/week | any programming language, Mathematics for Computer Science | [chat](https://discord.gg/mKRS7tY) ❌ | [Graph Search, Shortest Paths, and Data Structures](https://www.coursera.org/learn/algorithms-graphs-data-structures) | 4 weeks | 4-8 hours/week | Divide and Conquer, Sorting and Searching, and Randomized Algorithms | [chat](https://discord.gg/Qstqe4t) ❌ | [Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming](https://www.coursera.org/learn/algorithms-greedy) | 4 weeks | 4-8 hours/week | Graph Search, Shortest Paths, and Data Structures | [chat](https://discord.gg/dWVvjuz) ❌ | [Shortest Paths Revisited, NP-Complete Problems and What To Do About Them](https://www.coursera.org/learn/algorithms-npcomplete) | 4 weeks | 4-8 hours/week | Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming | [chat](https://discord.gg/dYuY78u)