IntroductionAlgorithm analysis plays a crucial role in the broader theory of computational complexity, which provides theoretical estimates of the resources required for any algorithm solving a given computing problem. Algorithm analysis provides insight into reasonable directions for searching for effective algorithms. It can be used in practice to choose an efficient algorithm that leads to better performance. Analyzing the efficiency of an algorithm is done by calculating the amount of computing resources such as memory space and execution time required to run the algorithm. The complexity of an algorithm can be determined based on the resources used by the particular algorithm. The amount of computing resources used depends on the dimension of the input data, also called the input size. Current Software for Time Efficiency Analysis of Recursive Algorithms Educational Software for Time Efficiency Analysis of Recursive Algorithms (ESRATEA) was developed by Pevac and Carpenter [1]. It was used by students of the algorithms course to learn and master the analysis of temporal performance of algorithms [2]. Currently, the problems are implemented in Java and grouped into chip-and-conquer, chip-and-be-conquer, and divide-and-conquer algorithms. This software allows the user to select the problem type and the software randomly chooses an example from the corresponding list. Then the user can perform a time efficiency analysis for this example by specifying the problem size, basic operation, recurrences, and finally derive the solution for the recurrences to determine the running time of the 'algorithm. It also scores the level of users based on the answers provided and displays solutions upon request.ESRATEA also provides an e...... middle of paper ......system.Works Cited[1] Pevac, I. , Carpenter, T. (2010) ESRATEA educational software for analyzing the time efficiency of recursive algorithms, WORLDCOMP'10 – FECS, Proc. of the 2010 International Competition. Conf. on the Frontiers of Education: Computer Science and Computer Engineering, (Ed. Arabnia, Clincy), Las Vegas, NV, SCREA Press, 367-373.[2] Levitine, A. (2012). Introduction to Algorithm Design and Analysis, (3rd edition). New Jersey, NJ: Addison-Wesley.[3] Pevac, I. (2011). Using models to introduce time efficiency analysis into an algorithms course, WORLDCOMP'11 – FECS, Proc. of the 2011 International Competition. Conf. on the Frontiers of Education: Computer Science and Computer Engineering, (Ed. Arabnia, Clincy), Las Vegas, NV, SCREA Press, 373-379.[4] Pevac, I. (2012). First experiments with Tutor for analyzing the time efficiency of recursive algorithms. The Journal of Computer Science in Colleges, 28(1), 56-65.