Update Sorting_Custom.mdx

content/3_Silver/Sorting_Custom.mdx

@@ -858,11 +858,11 @@ We also provide a more detailed explanation:
 
 First of all, let's figure out the value at each index in array $a$. It would be
 too slow to loop through every index in every update interval as well as every
-index in a query interval (The time complexity would be
-$O(N \cdot max_c + Q
-\cdot max_c)$ where $max_c$ is the maximum coordinate given
-in the input, which is up to $10^9$.). At the same time, that approach would
-take $O(max_c)$ memory, which is also too much. Instead, we make an observation
+index in a query interval
+(The complexity would be $O(C(N+Q))$,
+where $C$ is the maximum coordinate given in the input).
+At the same time, that approach would take $O(C)$ memory, which is also too much.
+Instead, we make an observation
 that will make prefix sums paired with coordinate compression a viable option.
 
 Not every index in the whole range from $1...10^9$ is used in updates. In fact,