diff --git a/algorithms/11-paths/2024-01-01-bf-to-astar/01-bf.md b/algorithms/11-paths/2024-01-01-bf-to-astar/01-bf.md
index 05bfb22..263e820 100644
--- a/algorithms/11-paths/2024-01-01-bf-to-astar/01-bf.md
+++ b/algorithms/11-paths/2024-01-01-bf-to-astar/01-bf.md
@@ -283,7 +283,7 @@ y = i / width
 ## Bellman-Ford
 
 If you have ever attended any Algorithms course that had path-finding in its
-sylabus, you probably feel like you've seen the algorithm above before[^3]… And
+syllabus, you probably feel like you've seen the algorithm above before[^3]… And
 yes, the first algorithm I have proposed is a very dumb version of the
 _Bellman-Ford_ algorithm, it's dumb, because it loops :wink: After our “looping”
 prevention we got to the point that is almost the _Bellman-Ford_ with the one
@@ -406,12 +406,12 @@ Let's have a short look at the time complexities of the presented algorithms:
 2. our naïve approach with the fixed count of iterations instead of the
    `do-while` loop results in the same worst-case time complexity:
    $$
-   \mathcal{O}(\vert V \vert \cdot \vert E \vert)
+   \Theta(\vert V \vert \cdot \vert E \vert)
    $$
 
 3. and finally the well-known Bellman-Ford's algorithm time complexity:
    $$
-   \mathcal{O}(\vert V \vert \cdot \vert E \vert)
+   \Theta(\vert V \vert \cdot \vert E \vert)
    $$
 
 ## Small refactor
diff --git a/algorithms/11-paths/2024-01-01-bf-to-astar/index.md b/algorithms/11-paths/2024-01-01-bf-to-astar/index.md
index 803e316..b75a764 100644
--- a/algorithms/11-paths/2024-01-01-bf-to-astar/index.md
+++ b/algorithms/11-paths/2024-01-01-bf-to-astar/index.md
@@ -10,6 +10,7 @@ tags:
 - bellman ford
 - dynamic programming
 - dijkstra
+- greedy
 - a star
 last_update:
   date: 2024-01-01