This repository consists of a faculty project for Algorithm and Data Structure ll, which tries to filter a list of address pairs, which is between 0 and 2^31.
This repository is public in order to show the solution to the problem, but it must not be reworked, copied, used, downloaded, disclosed or any other purpose. This repository is for the private and exclusive use of students in the discipline of Algorithm and Data Structure ll (2) of class 137 - 2020/1 of the Software Engineering course at the Polytechnic School of PUCRS college.
The proposed problem suggests that, given a list with pairs of numerical values (IPs), we must create a solution so that the list has the largest possible reduction, compressing the maximum possible IP addresses. That is, the algorithm created from the reversal of all addresses and compresses it in order to let it be reduced. At the end, a compressed list must be presented that blocks the same IP addresses. The statement states that in an IP address, first is the smallest IP number that was banned, and then the last blocked IP number, these two values being included to be blocked.
For example, following what has been said, we have some simplified address pairs for better understanding. In this IP list example, the final result, that is, the reduced IP list will be: 45389652-1045135809.
793359858-872845434
163828202-386942572
860031788-1045135809
220012220-481960112
107202696-258581056
77865186-199064861
207437354-311919151
125701728-213021371
851097643-935519522
613234685-874907996
432569835-566753675
45389652-232145031
896106680-1011116869
272672436-491730771
354054836-415525648
436958726-539840832
861203282-877295410
837159809-839258919
273032866-505234870
135087090-305043137
By: luizeduardomr & LeoMello07