diff --git a/algorithms/graph/bipartite_match.cpp b/algorithms/graph/bipartite_match.cpp
index 92215e4d44f496db696178cd1b13092d54d55be9..d77b0d3243e68ac4a06b133b45740cb412f599f5 100644
--- a/algorithms/graph/bipartite_match.cpp
+++ b/algorithms/graph/bipartite_match.cpp
@@ -1,8 +1,8 @@
 /**
  * Bipartite Matching
  *
- * Complexity (Time): O(V + E)
- * Complexity (Space): O(V + E)
+ * Complexity (Time): O(V*E)
+ * Complexity (Space): O(V*E)
  */
 
 vector<int> graph[MAX];
@@ -15,7 +15,7 @@ int dfs(int x) {
 
   cont[x] = 1;
   for (auto i : graph[x])
-    if (match[i] == -1 || dfs(match[v])) {
+    if (match[i] == -1 || dfs(match[i])) {
       match[i] = x;
       return 1;
     }