Merge pull request cp-algorithms#1185 from 3centroids/patch-2

jakobkogler · web-flow · commit b551119e9125 · 2023-10-27T20:04:37.000+02:00
grammar
diff --git a/src/data_structures/segment_tree.md b/src/data_structures/segment_tree.md
@@ -138,7 +138,7 @@ And if we stop partitioning whenever the query segment coincides with the vertex
 ### Update queries
 
 Now we want to modify a specific element in the array, let's say we want to do the assignment $a[i] = x$. 
-And we have to rebuild the Segment Tree, such that it correspond to the new, modified array. 
+And we have to rebuild the Segment Tree, such that it corresponds to the new, modified array. 
 
 This query is easier than the sum query. 
 Each level of a Segment Tree forms a partition of the array. 
