include codeSnip

solutions/platinum/kattis-segmentintersection.mdx

@@ -5,6 +5,8 @@ title: Line Segment Intersection
 author: Rameez Parwez
 ---
 
+[Unoffical Analysis](https://cp-algorithms.com/geometry/segments-intersection.html)
+
 ## Implementation
 
 **Time Complexity:** $\mathcal{O}(T)$, where $T$ is the number of test cases.
@@ -16,6 +18,7 @@ author: Rameez Parwez
 #include <bits/stdc++.h>
 using namespace std;
 
+// BeginCodeSnip{Finding intersection of two segments from CP Algorithms}
 const double EPS = 1E-9;
 
 struct Point {
@@ -94,7 +97,7 @@ bool intersect(Point a, Point b, Point c, Point d, Point& left, Point& right) {
                betw(c.x, d.x, left.x) && betw(c.y, d.y, left.y);
     }
 }
-
+// EndCodeSnip
 
 int main() {
     int test_case;