diff --git a/metrics.tex b/metrics.tex
index 6c7e08e..248de0f 100644
--- a/metrics.tex
+++ b/metrics.tex
@@ -165,7 +165,7 @@ \subsection{Heuristic}\label{subsec:heuristics}
   }
   \end{lstlisting}
 
-  The function SlidingWindowHeuristic systematically processes a list of vertices, each associated with a list of services, to identify optimal service combinations using a sliding window approach, given the constraints set by parameters verticesList and w (window size).
+  The function SlidingWindowHeuristic processes a list of vertices, each associated with a list of services, to identify optimal service combinations using a sliding window approach, given the constraints set by parameters verticesList and w (window size).
 
   Initially, the function establishes  $\text{G'}$ to store the optimal services or combinations identified during the process (line 2). It iterates from the start to the feasible end of the vertex list to ensure each possible window of services is evaluated (line 3). For each window, the function initializes minMetric to infinity and an empty list minMetricCombination to store the best service combination found within that specific window (line 5-6).