Final grade: 112%✅
This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, you will have to manipulate various sorting algorithms and choose the most appropriate solution(s) for optimized data sorting.

number of instructions and score:
sort hundred numbers
less than 700 -> 5
less than 900 -> 4
less than 1100 -> 3
less than 1300 -> 2
less than 1500 -> 1

sort five hundred numbers
less than 5500 -> 5
less than 7000 -> 4
less than 8500 -> 3
less than 10000 -> 2
less than 11500 -> 1

I got 5 in sorting hundred numbers and 4 in sorting five hundred numbers, and 112% as the final grade.(not perfect)

NOTICE

42 Project must be written in accordance with the 42 school norm, otherwise the grade is 0:

• Declarations must be at the beginning of a function
• Declaration and an initialisation cannot be on the same line
• Each function cannot have more than 25 lines of code
• You can only use allowed functions
• ...

English: https://github.com/42School/norminette/blob/master/pdf/en.norm.pdf
Japanese: https://github.com/42School/norminette/blob/master/pdf/ja.norm.pdf