❔ Finding the right algorithm for this task 🤔
Hello 
I'm quite new to C# and still don't know which algorithm is used when, what it does, how is it implemented, etc.
I found some programming tasks on the internet and I'd like to learn the algorithms that way.
The first task is:
The context:
Where:
For each line in this format:
Note:
The goal:
- I just want to help with what type of algorithm should I use for this task. Just the name is enough, I want to study the algorithm after and then try to code it on my own.
Thanks for any help
I'm quite new to C# and still don't know which algorithm is used when, what it does, how is it implemented, etc.
I found some programming tasks on the internet and I'd like to learn the algorithms that way.
The first task is:
- You receive input in this form:
The context:
There is a room with cables on the ground everywhere. You need to have 2 cables of the same connector type to connect them together. For example:
You can connect USB-C with USB-C but you can't connect USB-C with HDMI.
Where:
defines the size of the room (a rectangle).2 3is the length of the rectangle2
andis the width3
For each line in this format:
x y connector type
E.g.1 0 DVI
is a point on the coordinate of the rectangle's length1
andis a point on the width0
Note:
- All points (connectors) from the input will be on the edges of the rectangle never inside of it.
The goal:
The aim of this program is to find out whether all the cables can be connected together without being crossed.
So just imagine the points on the rectangle coordinates. Then connect every TWO points with the same connector with line. Check if the lines don't intersect.
If yes, write "It's not possible to connect the cables."
If no, write "It's possible to connect the cables."
- I just want to help with what type of algorithm should I use for this task. Just the name is enough, I want to study the algorithm after and then try to code it on my own.
Thanks for any help
