OmarKimo's blog

By OmarKimo, history, 3 weeks ago, In English

Let's say that we have n Rectangles with known coordinates and m Points with known coordinates.
How to count the number of points that lie inside each Rectangle given that the coordinates are integers (>= 0, <= 106) and n & m <= 106.
Surely, the complexity of O(n*m) is not desirable!
I think of Segment Tree but don't know how and if it's better or not!

May you help me, please?

Read more »

 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it

By OmarKimo, history, 16 months ago, In English

Is there any advice, materials, or resources on how to enhance the mathematical thinking in kids (e.g. since age 6)?

Read more »

 
 
 
 
  • Vote: I like it
  • +25
  • Vote: I do not like it