@@ -168,31 +168,30 @@ We generally process this table by columns (queries), but notice that in each ro
168168vector<int >parallel_binary_search (vector<int >& A, vector<int >& X) {
169169 int N = A.size();
170170 int M = X.size();
171- vector<int > left(M, -1);
172- vector<int > right(M, N-1);
171+ vector<int > l(M, -1), r(M, N-1);
173172
174173for (int step = 1; step <= ceil(log2(N)); ++step) {
175174 // Map to store indices of queries asking for this value.
176- unordered_map<int, vector<int>>mid_to_queries ;
175+ unordered_map<int, vector<int>>m_to_queries ;
177176
178- // Calculatemid and populate themid_to_queries map.
177+ // Calculatemiddle point and populate them_to_queries map.
179178 for (int i = 0; i < M; ++i) {
180- intmid = (left [i] +right [i]) / 2;
181- mid_to_queries[mid ].push_back(i);
179+ intm = (l [i] +r [i]) / 2;
180+ m_to_queries[m ].push_back(i);
182181 }
183182
184- // Process each value inmid_to_queries .
185- for (const auto& [mid , queries]:mid_to_queries ) {
183+ // Process each value inm_to_queries .
184+ for (const auto& [m , queries]:m_to_queries ) {
186185 for (int query : queries) {
187- if (X[query] < A[mid ]) {
188- right [query] =mid ;
186+ if (X[query] < A[m ]) {
187+ r [query] =m ;
189188 } else {
190- left [query] =mid ;
189+ l [query] =m ;
191190 }
192191 }
193192 }
194193}
195- returnleft ;
194+ returnl ;
196195}
197196```
198197