Computation step in time complexity of an algorithm, Computer Engineering

Assignment Help:

Q. Computation step in time complexity of an algorithm?

So First in the computation step the local processor executes an arithmetic and logic operation. Afterwards the several processors communicate with one another for exchanging messages and/or data. Therefore the time complexity can be computed on the grounds of communication cost and computational cost involved.

Time complexity of an algorithm fluctuates depending on the instance of input for a provided problem. For illustration the already sorted list (10, 17, 19, 21, 22, 33) will take less amount of time than reverse order of list (33, 22, 21, 19, 17, 10). The time complexity of algorithm has been classified into three forms which are.

i) Best Case Complexity;
ii) Average Case Complexity; and
iii) Worst Case Complexity.

The best case complexity is the minimum amount of time needed by algorithm for a provided input. The average case complexity is average running time needed by algorithm for a provided input. As in the same manner the worst case complexity is able to be defined as maximum amount of time needed by the algorithm for a provided input.

So the major factors occupied for analysing time complexity relies on the algorithm, specific set of inputs and parallel computer model. Mainly the size of input is a function of time complexity of algorithm.


Related Discussions:- Computation step in time complexity of an algorithm

Illustrate the uses of assembly language, Q. Illustrate the Uses of Assembl...

Q. Illustrate the Uses of Assembly Language? Uses of Assembly Language Assembly language is used mainly for writing short, efficient, specific interfacing modules/ subrou

Recombination - canonical genetic algorithm, Recombination: Therefore...

Recombination: Therefore during the selection and mating process then the GA repeatedly lines up pairs of individuals for reproduction. Hence the next question is how to gener

List the key notions concerning macro expansion, List the key notions conce...

List the key notions concerning macro expansion. Two key notions relating to macro expansion is: 1. Expansion time control flow- Determines the order of model statements tha

Define the term ''page traffic'', The term 'page traffic' describes? An...

The term 'page traffic' describes? Ans. Page Traffic describes the movement of pages in and out of memory.

The statement vline is used to insert vertical lines, Like ULINE the statem...

Like ULINE the statement VLINE is used to insert vertical lines. No , Vline is not used to insert vertical lines.

Find out the number of control lines for 32 to 1 multiplexer, The number of...

The number of control lines for 32 to 1 multiplexer is ? Ans. For 32 (2 5 ) the number of control lines and to select one i/p between them total 5 select lines are needed.

C++ program, A palindrome is a string that reads the same from both the end...

A palindrome is a string that reads the same from both the ends. Given a string S convert it to a palindrome by doing character replacement. Your task is to convert S to palindrome

what is polymorphism in c++, Polymorphism in C++ is the idea that a base c...

Polymorphism in C++ is the idea that a base class can be inherited by various classes. A base class pointer can point to its child class and a base class array can store dissimilar

arithmetic pipelines, Arithmetic Pipelines The method of pipelining ca...

Arithmetic Pipelines The method of pipelining can be applied to a variety of complex and slow arithmetic operations to speed up the processing time. The pipelines used for arit

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd