Hi everyone, I could not solve this problem in nlogn time. Someone have any idea? Please help. I need some tips.. Give an O(n log n)time algorithm to determine whether an n-vertex polygon is simple, but not necessarily convex. Thanks in advance Greetings, Sedef