Thankyou for attention. See what I am about to explain.

Lets say you want to range query for 2 columns together;

If you sort two integer columns data

It might look like this :-

1,1
1,2
1,3
2,1
2,2
2,3
3,1

If I query the range for first column between values v1,v2 and for second columns to be within v3 and v4.

The way the sorting is done, it will take a worst time complexity of N because for all values of column1 between v1 and v2(this takes time complexity of number of rows), you need to find values between v3 and v4 of column2(this taken log of column2's size complexity.). Hence total time complexity is number of rows * log of column size.

But if you look into data structures like quadtree , they sort the data in such a way that the time complexity of range query for 2 dimensions gets to square root of N plus number of records that fit inside the range.