The k-Partition ProblemBatakliev, Emil (Avtor) Robič, Borut (Mentor) arrayalgorithmtime complexityspace complexityIn this thesis we will analyze the k-Partition Problem. Specifically, we will analyze the five best algorithms for solving the Partition Problem, after which we will analyze five new algorithms for solving the k-Partition Problem. Two of these algorithms will be my contribution towards both problems. After we have understood how each algorithm works, we will test them among each other in order to figure out which algorithm is the fastest and why. We will also consider each algorithm's accuracy, since some algorithms trade their speed for precision. There will be a total of 70 test cases used throughout the testing phase. Some test cases will be random, and others specifically used as difficult test cases in regards to certain algorithms. Finally, we will shed light on the difference between theory and practice, that is, to the algorithms time complexities and their execution time. The goal of the thesis is not to find the fastest algorithm, but rather to analyze each of the algorithms and understand which of them is best suited for a given situation.20232023-05-30 07:35:09Magistrsko delo/naloga146398VisID: 35311COBISS_ID: 154896899sl