This algorithm optimizes the pizza delivery process for a chef based on specific constraints:
- a) Adherence to the delivery time for each order is crucial, with a time limit of 30 minutes per delivery.
- b) Failure to meet the delivery time requires the chef to provide a 50% discount voucher to the customer for their next order.
- c) The pizza chef travels at a speed of 45 km/h in a straight line, simulating a bird's-eye view.
- d) The algorithm optimizes the route based on the actual coordinates of each delivery address.
- e) The return journey is also optimized to enhance overall efficiency.
This code will be organized into three Java classes:
DeliveryPersonOrderGPS
It was my first encounter with this type of problem-solving.
This experience made me aware of my potential for further improvement.
The complexity of these exercises escalates rapidly, often leading me to dedicate entire weekends to comprehend certain solutions found online.
- Exercises not done : 1 -> 7
- Exercises done : 8 -> 22
This year, I was much more comfortable solving this type of problem since I had practiced a lot for those of the previous year.
Therefore, I was able to tackle many more exercises from the previous year.
- Exercises done : 1 -> 25 (maybe)
Two programs, both doing the same thing:
- FUSION performs a merge sort on 10,000 numbers ranging from
1to10,000(1; 2; 3; ... ; 9,999; 10,000). - FUSIONPP performs a merge sort on 1,000,000,000 numbers ranging from
1to1,000,000,000