This project consists in sorting data on a stack, with a limited set of instructions, using the lowest possible number of actions. To succeed I'll have to manipulate various types of algorithms and choose the one (of many) most appropriate solution for an optimized data sorting
- Great intro to big O notation and time complexity: https://www.youtube.com/watch?v=D6xkbGLQesk