You are given a set of points with their integer coordinates. You need to determine if there are convex quarilaterals in at most O(n^2) time.↵
↵
**For example:**↵
5↵
2 2↵
5 3↵
8 2↵
7 6↵
4 7↵
Has↵
↵
5↵
2 2↵
7 6↵
7 4↵
9 4↵
10 4↵
Has not↵
↵
Thank you for your help!
↵
**For example:**↵
5↵
2 2↵
5 3↵
8 2↵
7 6↵
4 7↵
Has↵
↵
5↵
2 2↵
7 6↵
7 4↵
9 4↵
10 4↵
Has not↵
↵
Thank you for your help!