Update prims.md

Yashgabani845 · web-flow · commit 1a4f5811b051 · 2024-06-08T12:17:14.000+05:30
diff --git a/dsa/Algorithms/prims.md b/dsa/Algorithms/prims.md
@@ -321,4 +321,4 @@ The MST contains the edges: [('A', 'B', 1), ('B', 'D', 2), ('B', 'C', 3)].
 
 ## Conclusion
 
-Prim's Algorithm is an efficient method for finding the Minimum Spanning Tree of a weighted undirected graph. It operates in O(E log V) time complexity using a priority queue, making it suitable for large graphs. Understanding and implementing this algorithm is fundamental for solving various network design problems and optimizing connectivity.
+Prim's Algorithm is an efficient method for finding the Minimum Spanning Tree of a weighted undirected graph. It operates in $O(E log V)$ time complexity using a priority queue, making it suitable for large graphs. Understanding and implementing this algorithm is fundamental for solving various network design problems and optimizing connectivity.

Original file line number	Diff line number	Diff line change
`@@ -321,4 +321,4 @@ The MST contains the edges: [('A', 'B', 1), ('B', 'D', 2), ('B', 'C', 3)].`
`321`	`321`
`322`	`322`	`## Conclusion`
`323`	`323`
`324`		`-Prim's Algorithm is an efficient method for finding the Minimum Spanning Tree of a weighted undirected graph. It operates in O(E log V) time complexity using a priority queue, making it suitable for large graphs. Understanding and implementing this algorithm is fundamental for solving various network design problems and optimizing connectivity.`
	`324`	`+Prim's Algorithm is an efficient method for finding the Minimum Spanning Tree of a weighted undirected graph. It operates in $O(E log V)$ time complexity using a priority queue, making it suitable for large graphs. Understanding and implementing this algorithm is fundamental for solving various network design problems and optimizing connectivity.`