Scribd
Upload
150 views

Analysis of Algorithms

This document discusses algorithm analysis. It defines an algorithm as a set of instructions to solve a problem and notes that algorithms have inputs and outputs. Algorithm analysis is important because some algorithms may be inefficient for large data sets. There are two types of complexity: time complexity, related to execution time, and space complexity, related to memory usage. When analyzing algorithms, we analyze the worst-case, best-case, and average-case running times. We also consider the resources like memory and time required. The goal of analysis is to select the most efficient algorithm for a given problem and data set size.

Uploaded by

Danish Hussain
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
150 views

Analysis of Algorithms

This document discusses algorithm analysis. It defines an algorithm as a set of instructions to solve a problem and notes that algorithms have inputs and outputs. Algorithm analysis is important because some algorithms may be inefficient for large data sets. There are two types of complexity: time complexity, related to execution time, and space complexity, related to memory usage. When analyzing algorithms, we analyze the worst-case, best-case, and average-case running times. We also consider the resources like memory and time required. The goal of analysis is to select the most efficient algorithm for a given problem and data set size.

Uploaded by

Danish Hussain
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Analysis of Algorithms

What is Algorithm?

Ans:

A specified set of simple instructions to be followed to solve a problem is called


algorithm.

In Algorithm we Takes a set of values, as input and produces a value, or set of


values, as output. These values are specified in many forms such as English or
computer program or as a pseudo-code.

In Data structures algorithm is the Methods of organizing data and in program it is


the combination of Program = algorithms + data structures.

Why need algorithm analysis ?


writing a program is not good enough The program may be inefficient!

If the program is run on a large data set, then the running time becomes an issue.
We make algorithm and test it before running the actual program.

Complexity of Algorithm?
There are 2 types of complexity we face in the algorithm.

(1) Time complexity


(2) Space complexity

Time complexity is related to check the execution time of the algorithm.

Space complexity is related to how much space a algorithm takes in the memory.

Example Of selecting a Problem:


We are given a list of N numbers, determine the k largest, where k ≤ N.

Make different algorithms:


Algorithm 1:

(1) Read N numbers into an array

(2) Sort the array in decreasing order by some simple algorithm

(3) Return the element in position k

Algorithm 2:

(1) Read the first k elements into an array and sort them in decreasing order

(2) Each remaining element is read one by one

(3) The element in the kth position is returned as the answer.

Which algorithm is better when

N =100 and k = 100?

N =100 and k = 1?

What happens when N = 1,000,000 and k = 500,000?

There exist better algorithms .

Analyze these algorithm to select the correct one.


We analyze only correct algorithm . To check that the algorithm is correct or not.

Pass a input from algorithm if it stop at right answer the algorithm is called
correct.

If the out algorithm stop at and give wrong output the algorithm is called
incorrect algorithm.

Analyzing an algorithm:
First of all predict the resources that the algorithm needs.
These resources include.

 Memory
 Communication bandwidth
 Computational time

Keep in mind that There are many fectors that effect the running time of the
algorithm these are below.

 computer
 compiler
 algorithm used
 input to the algorithm

The content of the input affects the running time their size may affect.

Run the instructions one after one on the same computer and analyze their
outputs.

Example:
Calculate ∑𝑛𝑖=1 𝑖2

2N+2

4N

1
 Lines 1 and 4 count for one unit each
 Line 3: executed N times, each time four units
 Line 2: (1 for initialization, N+1 for all the tests, N for all the increments)
total 2N + 2
 total cost: 6N + 4 O(N)

Cases in Alanalysis of algorithm :


(1) Wrost case:
The longest running time for any input of size n

An upper bound on the running time for any input guarantee that the
algorithm will never take longer

Example: Sort a set of numbers in increasing order; and the data is in


decreasing order. It takes longer time.

The worst case can occur fairly often in searching a database for a particular
piece of information

(2) Best-case running time


sort a set of numbers in increasing order; and the data is already in increasing
order it save times and take no time to sort.

(3) Average-case running time


May be difficult to define what “average” means.

Bounds are for the algorithms, rather than programs

Programs are just implementations of an algorithm, and almost always the


details of the program do not affect the bounds

Bounds are for algorithms, rather than problems


A problem can be solved with several algorithms, some are more efficient than
oothers

You might also like