Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
Finding the proper Algo (2D sorting)
I am supposed to create an O(n(logn)^2) algorithm wich, given as input a sequence S of points in the two dimensions (each point is discribed by a x value and a y value) the algorithm sould give or each point:
the number of elements from which each point is strictly bigger( both x and y bigger)
any help or idea would be appreciated!
0 · ·