Problem Classification

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:

  • Insertion Sort
  • Traveling Salesman Problem
  • Finding the sum of all values in a 3-D Array (n x n x n)
  • Radix Sort
  • Brute Force Password Cracker

Note for Question 1, 2, 4 & 5 above.

  • https://www.geeksforgeeks.org/insertion-sort/
  • https://mathworld.wolfram.com/TravelingSalesmanProblem.html
  • https://www.geeksforgeeks.org/radix-sort/
  • Assume that your password alphabet is english letters (capital and lowercase) and numbers
Academic Honesty!
It is not our intention to break the school's academic policy. Posted solutions are meant to be used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly complete the form. Please provide a valid email address and we will get back to you within 24 hours. Payment is through PayPal, Buy me a Coffee or Cryptocurrency. We are a nonprofit organization however we need funds to keep this organization operating and to be able to complete our research and development projects.