chore: sync content to repo

2026-10-25 09:34:00 +08:00 · 2026-09-29 14:28:58 +00:00
parent 66f516ddf1
commit 970af12f70
12 changed files with 15 additions and 30 deletions
@@ -1,3 +1,3 @@
 # A* Algorithm

-A* is a shortest path algorithm that uses a heuristic to guide its search toward the goal, making it faster than Dijkstra's in practice. The heuristic estimates the cost from the current node to the destination, helping the algorithm prioritize more promising paths. It is widely used in game pathfinding and robotics.
+A\* is a shortest path algorithm that uses a heuristic to guide its search toward the goal, making it faster than Dijkstra's in practice. The heuristic estimates the cost from the current node to the destination, helping the algorithm prioritize more promising paths. It is widely used in game pathfinding and robotics.
@@ -7,8 +7,4 @@ Visit the following resources to learn more:
 - [@video@Arrays in Python](https://www.youtube.com/watch?v=gDqQf4Ekr2A&ab_channel=codebasics)
 - [@video@Arrays in Java](https://www.youtube.com/watch?v=ei_4Nt7XWOw&ab_channel=BroCode)
 - [@video@Arrays in Javascript](https://www.youtube.com/watch?v=yQ1fz8LY354)
- [@video@Arrays in GoLang](https://www.youtube.com/watch?v=e-oBn806Pzc&pp=ygUIYXJyYXkgZ28%3D)
- [@video@Arrays in C#](https://www.youtube.com/watch?v=YiE0oetGMAg&pp=ygUIYXJyYXkgYyM%3D)
- [@video@Arrays in C++](https://www.youtube.com/watch?v=G38hQKXa_RU&pp=ygUJYXJyYXkgYysr)
- [@video@Arrays in Rust](https://www.youtube.com/watch?v=cH6Qv47MPwk&pp=ygUKYXJyYXkgcnVzdA%3D%3D)
- [@video@Arrays in Ruby](https://www.youtube.com/watch?v=SP3Vf2KcYeU&pp=ygUKYXJyYXkgcnVieQ%3D%3D)
+- [@video@Arrays in GoLang](https://www.youtube.com/watch?v=e-oBn806Pzc&pp=ygUIYXJyYXkgZ28%3D)
@@ -6,5 +6,4 @@ Visit the following resources to learn more:

 - [@official@Visit Dedicated C++ Roadmap](https://roadmap.sh/cpp)
 - [@article@Learn Cpp](https://learncpp.com/)
- [@article@C++ Reference](https://en.cppreference.com/)
- [@feed@Explore top posts about C++](https://app.daily.dev/tags/c++?ref=roadmapsh)
+- [@article@C++ Reference](https://en.cppreference.com/)
@@ -4,4 +4,5 @@ Divide and conquer is a powerful algorithm design technique that solves a proble

 Visit the following resources to learn more:

+- [@article@Merge Sort in Python: Step-by-Step Guide + Code](https://roadmap.sh/python/merge-sort)
 - [@video@Divide & Conquer Algorithm In 3 Minutes](https://www.youtube.com/watch?v=YOh6hBtX5l0)
@@ -7,7 +7,4 @@ Visit the following resources to learn more:
 - [@roadmap@Visit Dedicated Go Roadmap](https://roadmap.sh/golang)
 - [@official@A Tour of Go – Go Basics](https://go.dev/tour/welcome/1)
 - [@official@Go Reference Documentation](https://go.dev/doc/)
- [@article@Go by Example - annotated example programs](https://gobyexample.com/)
- [@article@Making a RESTful JSON API in Go](https://thenewstack.io/make-a-restful-json-api-go/)
- [@article@Go, the Programming Language of the Cloud](https://thenewstack.io/go-the-programming-language-of-the-cloud/)
- [@feed@Explore top posts about Golang](https://app.daily.dev/tags/golang?ref=roadmapsh)
+- [@article@Go, the Programming Language of the Cloud](https://thenewstack.io/go-the-programming-language-of-the-cloud/)
@@ -7,5 +7,4 @@ Visit the following resources to learn more:
 - [@roadmap@Visit Dedicated Java Roadmap](https://roadmap.sh/java)
 - [@official@Java Website](https://www.java.com/)
 - [@video@Java Crash Course](https://www.youtube.com/watch?v=eIrMbAQSU34)
- [@video@Complete Java course](https://www.youtube.com/watch?v=xk4_1vDrzzo)
- [@feed@Explore top posts about Java](https://app.daily.dev/tags/java?ref=roadmapsh)
+- [@video@Complete Java course](https://www.youtube.com/watch?v=xk4_1vDrzzo)
@@ -5,8 +5,6 @@ JavaScript allows you to add interactivity to your pages. Common examples that y
 Visit the following resources to learn more:

 - [@roadmap@Visit Dedicated JavaScript Roadmap](https://roadmap.sh/javascript)
+- [@official@Official Documentation](https://nodejs.org/en/learn/getting-started/introduction-to-nodejs)
 - [@article@The Modern JavaScript Tutorial](https://javascript.info/)
- [@article@Official Documentation](https://nodejs.org/en/learn/getting-started/introduction-to-nodejs)
- [@video@JavaScript Crash Course for Beginners](https://youtu.be/hdI2bqOjy3c)
- [@video@Node.js Crash Course](https://www.youtube.com/watch?v=fBNz5xF-Kx4)
- [@video@Node.js Tutorial for Beginners](https://www.youtube.com/watch?v=TlB_eWDSMt4)
+- [@video@JavaScript Crash Course for Beginners](https://youtu.be/hdI2bqOjy3c)
@@ -5,10 +5,6 @@ Python is a dynamically typed, interpreted language with a concise and readable
 Visit the following resources to learn more:

 - [@roadmap@Visit Dedicated Python Roadmap](https://roadmap.sh/python)
- [@official@Python Website](https://www.python.org/)
+- [@official@Visit Dedicated Python for Data Analysis Roadmap](https://roadmap.sh/python-data-analysis)
 - [@official@Python Getting Started](https://www.python.org/about/gettingstarted/)
- [@article@Automate the Boring Stuff](https://automatetheboringstuff.com/)
- [@article@Python principles - Python basics](https://pythonprinciples.com/)
- [@article@Python Crash Course](https://ehmatthes.github.io/pcc/)
- [@article@An Introduction to Python for Non-Programmers](https://thenewstack.io/an-introduction-to-python-for-non-programmers/)
- [@feed@Explore top posts about Python](https://app.daily.dev/tags/python?ref=roadmapsh)
+- [@article@An Introduction to Python for Non-Programmers](https://thenewstack.io/an-introduction-to-python-for-non-programmers/)
@@ -4,4 +4,5 @@ Recursion is a technique where a function calls itself with a smaller version of

 Visit the following resources to learn more:

- [@video@Recursion in 100 Seconds](https://www.youtube.com/watch?v=rf60MejMz3E)
+- [@video@Recursion in 100 Seconds](https://www.youtube.com/watch?v=rf60MejMz3E)
+- [@article@Merge Sort in Python: Step-by-Step Guide + Code](https://roadmap.sh/python/merge-sort)
@@ -6,5 +6,4 @@ Visit the following resources to learn more:

 - [@official@Ruby Website](https://www.ruby-lang.org/en/)
 - [@article@Learn Ruby in 20 minutes](https://www.ruby-lang.org/en/documentation/quickstart/)
- [@article@Ruby, An Introduction to a Programmer’s Best Friend](https://thenewstack.io/ruby-a-programmers-best-friend/)
- [@feed@Explore top posts about Ruby](https://app.daily.dev/tags/ruby?ref=roadmapsh)
+- [@article@Ruby, An Introduction to a Programmer’s Best Friend](https://thenewstack.io/ruby-a-programmers-best-friend/)
@@ -7,5 +7,4 @@ Visit the following resources to learn more:
 - [@article@The Rust Programming Language - online book](https://doc.rust-lang.org/book/)
 - [@article@Rust by Example - collection of runnable examples](https://doc.rust-lang.org/stable/rust-by-example/index.html)
 - [@article@Rust vs. Go: Why They’re Better Together](https://thenewstack.io/rust-vs-go-why-theyre-better-together/)
- [@article@Rust by the Numbers: The Rust Programming Language in 2021](https://thenewstack.io/rust-by-the-numbers-the-rust-programming-language-in-2021/)
- [@feed@Explore top posts about Rust](https://app.daily.dev/tags/rust?ref=roadmapsh)
+- [@article@Rust by the Numbers: The Rust Programming Language in 2021](https://thenewstack.io/rust-by-the-numbers-the-rust-programming-language-in-2021/)
@@ -1,3 +1,3 @@
 # Graph Data Structure

-Shortest path algorithms find the minimum-cost route between two nodes in a weighted graph. Different algorithms suit different scenarios: Dijkstra's handles non-negative weights, Bellman-Ford handles negative weights, and A* uses heuristics for faster pathfinding. These algorithms underlie GPS navigation, network routing, and game AI.
+Shortest path algorithms find the minimum-cost route between two nodes in a weighted graph. Different algorithms suit different scenarios: Dijkstra's handles non-negative weights, Bellman-Ford handles negative weights, and A\* uses heuristics for faster pathfinding. These algorithms underlie GPS navigation, network routing, and game AI.