Return to Question

Some days ago a new user posed a problem and sketched a sweeping line algorithm combined with a tree data structure to solve it. Here the problem, as far as I remember:

There is a set of rectangles with sides parallel to x and y aches and a set of points. find the point that is enclosed by the largest number of rectangles.

This was the link to the question before it was deleted: https://cs.stackexchange.com/questions/79534/point-contained-in-the-most-rectangles

The user also tried to give an estimation of the running time. My impression was that both the algorithm and the running time estimation were correct. He wrote that he wants to know if the algorithm is correct because he is not familiar with this kind of algorithm. A user told him in a comment that such kind of questions (check my algorithm and maybe check the estimation) are not welcome here. When I came back to this page some time later it was removed.

As far as I can see question of how to solve a problem algorithmically are allowed on this site. Also I see that posters should try as much as possible to solve there problem and also post their efforts here and tell what is there problem ("What have you tried and where did you get stuck?") So im very puzzled by the fact that reviewing an algorithm and its running time is not in scope off this site. Does the user post too much? should he only post the first three lines of his algorithm and write "I do not know how to continue and do not know how to estimate the running time"? The seems to be a little bit ridiculous. But it also seems to be the consequence of such a "we do not review" policy.

Some days ago a new user posed a problem and sketched a sweeping line algorithm combined with a tree data structure to solve it. Here the problem, as far as I remember:

There is a set of rectangles with sides parallel to x and y axes and a set of points. find the point that is enclosed by the largest number of rectangles.

This was the link to the question before it was deleted: https://cs.stackexchange.com/questions/79534/point-contained-in-the-most-rectangles

The user also tried to give an estimation of the running time. My impression was that both the algorithm and the running time estimation were correct. He wrote that he wants to know if the algorithm is correct because he is not familiar with this kind of algorithm. A user told him in a comment that such kind of questions (check my algorithm and maybe check the estimation) are not welcome here. When I came back to this page some time later it was removed.

As far as I can see question of how to solve a problem algorithmically are allowed on this site. Also I see that posters should try as much as possible to solve there problem and also post their efforts here and tell what is there problem ("What have you tried and where did you get stuck?") So im very puzzled by the fact that reviewing an algorithm and its running time is not in scope off this site. Does the user post too much? should he only post the first three lines of his algorithm and write "I do not know how to continue and do not know how to estimate the running time"? The seems to be a little bit ridiculous. But it also seems to be the consequence of such a "we do not review" policy.

Some days ago a new user posed a problem and sketched a sweeping line algorithm combined with a tree data structure to solve it. Here the problem, ass far as I remember:

There is a set of rectangles with sides parallel to x and y aches and a set of points. find the point that is enclosed by the largest number of rectangles. This was the link to the question before it was deleted: https://cs.stackexchange.com/questions/79534/point-contained-in-the-most-rectangles

The user also tried to give an estimation of the running time. My impression was that both the algorithm and the running time estimation were correct. He wrote that he wants to know if the algorithm is correct because he is not familiar with this kind of algorithm. A user told him in a comment that such kind of questions (check my algorithm and maybe check the estimation) are not welcome here. When I came back to this page some time later it was removed.

As far as I can see question of how to solve a problem algorithmically are allowed on this site. Also I see that posters should try as much as possible to solve there problem and also post their efforts here and tell what is there problem ("What have you tried and where did you get stuck?") So im very puzzled by the fact that reviewing an algorithm and its running time is not in scope off this site. Does the user post too much? should he only post the first three lines of his algorithm and write "I do not know how to continue and do not know how to estimate the running time"? The seems to be a little bit ridiculous. But it also seems to be the consequence of such a "we do not review" policy.

Some days ago a new user posed a problem and sketched a sweeping line algorithm combined with a tree data structure to solve it. Here the problem, as far as I remember:

There is a set of rectangles with sides parallel to x and y aches and a set of points. find the point that is enclosed by the largest number of rectangles.

This was the link to the question before it was deleted: https://cs.stackexchange.com/questions/79534/point-contained-in-the-most-rectangles

The user also tried to give an estimation of the running time. My impression was that both the algorithm and the running time estimation were correct. He wrote that he wants to know if the algorithm is correct because he is not familiar with this kind of algorithm. A user told him in a comment that such kind of questions (check my algorithm and maybe check the estimation) are not welcome here. When I came back to this page some time later it was removed.

As far as I can see question of how to solve a problem algorithmically are allowed on this site. Also I see that posters should try as much as possible to solve there problem and also post their efforts here and tell what is there problem ("What have you tried and where did you get stuck?") So im very puzzled by the fact that reviewing an algorithm and its running time is not in scope off this site. Does the user post too much? should he only post the first three lines of his algorithm and write "I do not know how to continue and do not know how to estimate the running time"? The seems to be a little bit ridiculous. But it also seems to be the consequence of such a "we do not review" policy.

Some days ago a new user posed a problem and sketched a sweeping line algorithm combined with a tree datasturcture to solve it. Here the problem, as far as I remember:

There is a set of rectancles with sides parallel to x and y aches and a set of points. find the point that is enclosedd by the largest number of rectangles. This was the link to the question before it was deleted.

https://cs.stackexchange.com/questions/79534/point-contained-in-the-most-rectangles

The user also tried to give an estimation of the running time. My impression was that both the algorithm and the running time estimation were correct. He wrote that he wants to know if the algorithm is correct because he is not familiar with this kind of algorithm. A user with high reputation told him in a comment that such kind of questions (check my algorithm and check my the estimation) are not welcome her. When I came back to this page some time later it was removed.

As far as I can see question of "how to solve a problem algorithmically" are allowed on this site. Also I see that posters should try as much as poassible to solve there problem and also post their eforts here and tell what is there problem ("What have you tried and where did you get stuck?")

So im very puzzled by the fact that reviewing an algorithm and its running time is not in scope off this site. Does the user post too much? Should he only post the first three lines of his algorithm and write "I do not know how to continue and do not know how to estimate the runnung time"? The seems to be a little bit ridculous. But it also seems to be the consequence of such a "we do not review" policy.

Some days ago a new user posed a problem and sketched a sweeping line algorithm combined with a tree data structure to solve it. Here the problem, ass far as I remember:

There is a set of rectangles with sides parallel to x and y aches and a set of points. find the point that is enclosed by the largest number of rectangles. This was the link to the question before it was deleted: https://cs.stackexchange.com/questions/79534/point-contained-in-the-most-rectangles

The user also tried to give an estimation of the running time. My impression was that both the algorithm and the running time estimation were correct. He wrote that he wants to know if the algorithm is correct because he is not familiar with this kind of algorithm. A user told him in a comment that such kind of questions (check my algorithm and maybe check the estimation) are not welcome here. When I came back to this page some time later it was removed.

As far as I can see question of how to solve a problem algorithmically are allowed on this site. Also I see that posters should try as much as possible to solve there problem and also post their efforts here and tell what is there problem ("What have you tried and where did you get stuck?") So im very puzzled by the fact that reviewing an algorithm and its running time is not in scope off this site. Does the user post too much? should he only post the first three lines of his algorithm and write "I do not know how to continue and do not know how to estimate the running time"? The seems to be a little bit ridiculous. But it also seems to be the consequence of such a "we do not review" policy.