1. Informal description of an algorithm being a solutions basis:

2. Algorithms pseudocode implementation:

3. Justification of an algorithms correctness:

4. Estimation of algorithms complexity:

Question= Find an algorithm which determines intersection of two input convex polygons. Prove algorithm correctness and estimate its complexit

Algorithm and data structure (geometric algorithms, dynamic programming)

Please answers all of them