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

Queueing process, explain in detail about queueing process

explain in detail about queueing process

Arterial puncture - specimen collection, Arterial puncture - Specimen colle...

Arterial puncture - Specimen collection: Arterial puncture:    this requires special skill and usually performed only by physician. The preferred site is radial arter

Define message passing, Q. Define Message Passing? The PVM communicatio...

Q. Define Message Passing? The PVM communication model offers asynchronous blocking receive and asynchronous blocking send and nonblocking receive functions. In our terminology

Show the features of a typical floating-point representation, Q. Show the F...

Q. Show the Features of a typical floating-point representation? The features of a typical floating-point representation of 32 bits in above figure are: Left-most bit is

What are the input devices, What are the Input devices Various devices ...

What are the Input devices Various devices are available for data input on graphics workstations. Most systems have a keyboard and one or more additional devices specially desi

Uninformed search strategies - artificial intelligence, Uninformed Search S...

Uninformed Search Strategies: To be able to undertake an unaware search, there is really important that the entire agent needs to know is the primary state, then the possible

Describe about general-purpose microprocessor, Q. Describe about general-pu...

Q. Describe about general-purpose microprocessor? Keeping rapidity with electronics as more and more components were fabricated on a single chip fewer chips were required to ma

Difference between packet switching and circuit switching, What are the adv...

What are the advantages and disadvantages of packet switching over circuit switching? The comparison of packet switching and circuit switching demonstrating advantages and disa

What is a work process, What is a work process? A work process is where ...

What is a work process? A work process is where individual dialog steps are in fact processed and the work is done.  Every work process ocuurs one type of request.

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