Update algorithms/search/binary_search/split_array_largest_sum/README.md

BrianLusina · coderabbitai[bot] · web-flow · commit 68db8aeb251f · 2026-01-19T10:05:38.000+03:00
Co-authored-by: coderabbitai[bot] &lt;136622811+coderabbitai[bot]@users.noreply.github.com&gt;
diff --git a/algorithms/search/binary_search/split_array_largest_sum/README.md b/algorithms/search/binary_search/split_array_largest_sum/README.md
@@ -103,4 +103,4 @@ The time complexity becomes `n log(m)` because the `can_split` function is calle
 
 ### Space Complexity
 
-The time complexity of this solution is O(1) because only constant space is used.
+The space complexity of this solution is O(1) because only constant space is used.

Original file line number	Diff line number	Diff line change
@@ -103,4 +103,4 @@ The time complexity becomes `n log(m)` because the `can_split` function is calle
`103`	`103`
`104`	`104`	`### Space Complexity`
`105`	`105`
`106`		`-The time complexity of this solution is O(1) because only constant space is used.`
	`106`	`+The space complexity of this solution is O(1) because only constant space is used.`