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

Show packing and unpacking data, Q. Show Packing and Unpacking Data? P...

Q. Show Packing and Unpacking Data? Packing and Unpacking Data  pvm_packs - Pack active message buffer with arrays of prescribed data type: int info = pvm_pac

Binary resolution, Binary Resolution: However we saw unit resolution f...

Binary Resolution: However we saw unit resolution for a propositional inference rule in the previous lecture:  (A?  B,   ¬B) /A Thus we can take this a little further to

Define about exe programs, Q. Define about EXE Programs? An EXE program...

Q. Define about EXE Programs? An EXE program is stored on disk with extension .exe. EXE programs are longer than COM programs as every EXE program is related with an EXE header

Post interrupts - computer architecture, Post interrupts - computer archite...

Post interrupts - computer architecture: Post interrupts Exact interrupts examine interrupt bit on entering WB Longer latency Handle immediately

Explain 32 to 1 multiplexer tree, Why is Multiplexer Tree needed? Draw ...

Why is Multiplexer Tree needed? Draw the block diagram of a 32:1 Multiplexer Tree and explain how input is directed to the output in this system. Ans. One of the possible

Programming in c, Write a program to find the area under the curve y = f(x)...

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b

What are the functions of passes used in two-pass assembler, What are the f...

What are the functions of passes used in two-pass assembler? In an assembly language program, two pass translations can handle forward references early. The subsequent task

What is sorted linked list, Linked list means node which is linked each oth...

Linked list means node which is linked each other with  a line. It means that every node is connected with another one. Every node of the list hold the reference of the next node.

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