Lines Matching refs:middle
98 int middle = (a + b)/2;
114 if( i0 == middle )
116 if( i0 > middle )
122 float pivot = vals[ofs[middle]];
124 for( k = a0; k < middle; k++ )
129 for( k = b0; k > middle; k-- )
136 return vals[ofs[middle]];
253 int middle = (first + last)/2;
255 computeSums(points, ptofs, middle+1, last, rsums);
258 stack[top++] = SubTree(first, middle, left, depth+1);
259 stack[top++] = SubTree(middle+1, last, right, depth+1);
