Composed to fulfill Tucil 2 IF2211 Strategi Algoritma

This program is used for find closest pair from random points generated. Program retrieve number of random points to generate and number of dimension of its points from users. Technically program use Divide and Conquer algorithm to find the closest pair, but program use Brute-Force algorithm as well as a benchmark. Program use two factor to compare the efficiency of the algorithm: Execution time and number of euclidean operation operated. If number of dimension inputed is lower or equal by three, program can visualize the scattering diagram as well.

│   README.md
│
├───bin
│       .gitignore
│
├───doc
│       Tucil2_13521109_13521119.pdf
│
├───image
│       result.jpg
│       splash_screen.jpg
│
└───src
        bruteForce.py
        dataType.py
        divideConquer.py
        IO.py
        main.py
        visual.py

• python3
• customtkinter version 5.1.2

1. install customtkinter using pip install customtkinter==5.1.2 in ..\Tucil2_13521109-13521119 directory
2. type python3 main.py or python3 main.py in ..\Tucil2_13521109-13521119\src directory