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

Decoder, how to make a dec oder

how to make a dec oder

DLD, Construction of j-k using 4-bit shift register

Construction of j-k using 4-bit shift register

Jewel polishing, Byteland county is very famous for luminous jewels. Lumino...

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

Combinational logic, At a particular moment in time the output of a COMBINA...

At a particular moment in time the output of a COMBINATIONAL logic circuit depends uponthe inputs to the circuit at the same instant.(Unlike sequential logic circuits where the out

Explain busy hour calling rate in telephone traffic, With reference to tele...

With reference to telephone traffic, explain the terms BHCR. BHCR: Busy hour calling rate is explained as the average number of calls originated through a subscriber througho

ASP.NET, I have developed a web application in .net & if the web applicati...

I have developed a web application in .net & if the web application is idle for some time & after that if we perform some action on that web page then it doesn''t respond. Can you

What is an i/o channel, What is an I/O channel?  An I/O channel is actu...

What is an I/O channel?  An I/O channel is actually a special purpose processor, also known as peripheral processor. The main processor initiates a transfer by passing the need

What is assembler, What is Assembler An assembler is a program which ta...

What is Assembler An assembler is a program which takes as input a symbolic language program and produces output as its binary machine language equivalent. The input is known a

Boardcoloring, write a java program to board coloring

write a java program to board coloring

Catch output from child tasks, Q. Catch output from child tasks? ...

Q. Catch output from child tasks? int pvm_catchout( FILE *ff ) Catch output from child tasks. ff is file descriptor on which we write collected output. The defau

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