Use C++ basics to solve the program
Prepare a program that can be compiled. If it doesn't compile I won't be able to test it, and you won't get all the points.
Evaluate the running time of the Stooge Sort Algorithm using Recursion Tree. Put your results as your initial guess for the substitution method and prove your running time using substitution method.
Use the Master Theorem: T(n) =a T(n/b)+f(n), and prove the running time.
Write the stooge sort in a programming language and compare it's running time with the running time of the insertion sort algorithm (You can produce 2000 random numbers with their copy and run the algorithms on both copies and find the running time).
Describe the terms in detail. Use C++ language to solve this problem.