From 746dd98f722ebb966ffd1a507e9d6bd26981f39c Mon Sep 17 00:00:00 2001
From: Svyatoslav Svyatkin <62288123+dmhd6219@users.noreply.github.com>
Date: Fri, 4 Aug 2023 13:43:40 +0300
Subject: [PATCH] Update README.md

---
 README.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/README.md b/README.md
index 089c5f8..3d7cd58 100644
--- a/README.md
+++ b/README.md
@@ -1,6 +1,7 @@
 # Sweep Line Algorithm
 Was created as homework for Data Structures and Algorythms course at Innopolis University.
 
+## Description
 Implement Sweep line algorithm using the sorting algorithm and self-balanced binary search tree you implemented in other parts of this homework. Write a program that given a collection of line segments detects if any two intersect.
 
 **Input format.** First line of the input contains a number *N* (*0* < *N* < *10^6*). Each of the next *N* lines contains a description of a segment *PQ*, consisting of 4 coordinates separated by spaces: *xP yP xQ yQ*. Coordinates are all integers (*−2^21* ≤ *x*, *y* ≤ *2^21*).