Description

In this assignment, we will be analyzing various algorithms to:
• Understand the general complexity and efficiency of the algorithm
• Identify the runtime efficiency in Big O Notation
• Complexity Classification for the algorithms

You must justify and explain your reasoning for each aspect listed above for the following algorithm/problem:
1. Insertion Sort
2. Traveling Salesman Problem
3. Finding the sum of all values in a 3-D Array (n x n x n)
4. Radix Sort
5. Brute Force Password Cracker

Note for Question 1, 2, 4 & 5 above. 
1. https://www.geeksforgeeks.org/insertion-sort/ 

2. https://mathworld.wolfram.com/TravelingSalesmanProblem.html 

4. https://www.geeksforgeeks.org/radix-sort/ 

5. Assume that your password alphabet is english letters (capital and lowercase) and numbers