Learning Objectives At the end of this project, you are expected to be able to explain to anyone, without the help of Google:
General At least four different sorting algorithms What is the Big O notation, and how to evaluate the time complexity of an algorithm How to select the best sorting algorithm for a given input What is a stable sorting algorithm Copyright - Plagiarism You are tasked to come up with solutions for the tasks below yourself to meet with the above learning objectives. You will not be able to meet the objectives of this or any following project by copying and pasting someone else’s work. You are not allowed to publish any content of this project. Any form of plagiarism is strictly forbidden and will result in removal from the program.