Unit1 - Analysis and Complexity of An Algorithm - KCS503
An algorithm is a finite sequence of instructions designed to solve a specific problem, and its efficiency is analyzed based on performance metrics. The performance is evaluated through Time Complexity, which measures execution time, and Space Complexity, which assesses memory usage. Time Complexity is deemed more important than Space Complexity in evaluating an algorithm's efficiency.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
11 views13 pages
Unit1 - Analysis and Complexity of An Algorithm - KCS503
An algorithm is a finite sequence of instructions designed to solve a specific problem, and its efficiency is analyzed based on performance metrics. The performance is evaluated through Time Complexity, which measures execution time, and Space Complexity, which assesses memory usage. Time Complexity is deemed more important than Space Complexity in evaluating an algorithm's efficiency.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13
Analysis and Complexity of an Algorithm
As discussed an Algorithm is defined as “An algorithm is a step-by-step
finite sequence of instructions to solve a particular problem.” The analysis of algorithm is performed to calculate the efficiency of an algorithm. The efficiency of an algorithm is measured on the basis of the performance of the algorithm. We can measure the performance of an algorithm by computing two factors: 1. Amount of time required by an algorithm to execute (Time Complexity). 2. Amount of space required by an algorithm (Space Complexity).
Time Complexity means CPU Time
Space Complexity means space allocated in main memory or RAM So which is more important? Time Complexity is more important than Space Complexity