INTRODUCTION TO COMPUTER 1 in NCU
- Craving for a better solution.
- This code is implemented by k-partition problem
- ex:
the number of treasures:5, size of package:2
Step1: [5 3 2 1 4] sort->[1 2 3 4 5]
sum=15, average=5
Step2: [1] []
Step3: [1 2] [1] [2] []
......
https://github.com/JiaHanXie/Divide-Treasures/blob/main/109_1_PA2_Divide_Treasures_release.pdf