APA_LAB#1.md

Programming and Analysis of Algorithms LAB #1

Algorithm Analysis. Time complexity of the algorithms.

Prerequisites:

• The time analysis of the algorithms
• Time: 2-4 hours

Objectives:

• The empirical analysis of the algorithms
• The theoretical analysis of the algorithms
• Determining temporal and asymptotic complexity of algorithms

General Requirements:

Laboratory work is considered as successfully passed after fulfilling the following steps:

• Submission Process

Laboratory Requirements:

• The time complexity analysis of the algorithms. [Theoretical notes] (https://github.com/BestMujik/APA_labs/blob/master/L3_apa.doc)
• Empirical analysis of the algorithms from 6th section.
• Determine temporal relationship determining the complexity for these algorithms.
• Determine the asymptotic complexity of algorithms.
• Answer to the theoretical questions.
• Report (template)

References:

• [Time complexity 1]http://www.studytonight.com/data-structures/time-complexity-of-algorithms)
• [Time complexity 2]https://www.sitepoint.com/time-complexity-algorithms/)