A common person's faith is that a computer can do anything. It is far from truth. In realism computer can carry out only definite predefined instructions. The formal illustration of this model like a sequence of instructions is called as an algorithm, & coded algorithm, within a particular computer language is called as program. Analysis of algorithms has been an area of research into the computer science; evolution of extremely high speed computers has not diluted the requirement for the design of time-efficient algorithms.

In computer science, Complexity theory is a part of theory of computation dealing along with the resources needed during computation to solve out a specified problem. The most common resources are time (how several steps (time) does it take to solve out a problem) and space (how much memory does it take to solve out a problem). It might be noted that complexity theory differs from computability theory that deals with whether a difficulty can be solved or not through algorithms, in spite of the resources needed.

Analysis of Algorithms is field of computer science whose target is to understand the complexity of algorithms. Whereas very large amount of research work is devoted to the worst-case evaluations, the focus within these pages is methods for average-case. One can grasp easily that the focus has shifted through computer to computer programming & after that to creation of an algorithm. It is algorithm design, spirit of problem solving.

Posted Date: 4/4/2013 5:35:30 AM | Location : United States

Ask an Expert

Related Discussions:- Analysis of algorithms, Assignment Help, Ask Question on Analysis of algorithms, Get Answer, Expert's Help, Analysis of algorithms Discussions

Write discussion on Analysis of algorithms
Your posts are moderated

Write your message here..

Related Questions

Stack, implement multiple stacks ina single dimensional array. write algori... implement multiple stacks ina single dimensional array. write algorithams for various stack operation for them.

Merge sort, #question. merging 4 sorted files containing 50,10,25,15 record... #question. merging 4 sorted files containing 50,10,25,15 records will take time?

Function overloading, program on function loading program on function loading

Darw a flowchart that inputs country someone is visiting, Regis lives in Br... Regis lives in Brazil and frequently travels to USA, Japan and Europe. He wants to be able to convert Brazilian Reais into US dollars, European euros and Japanese yen. Conversion f

B-TREE and AVL tree diffrance, Explain process of B-TREE and what differen... Explain process of B-TREE and what difference between AVL Tree Using Algorithms

Algorithm to find maximum and minimum numbers, Give an algorithm to find bo... Give an algorithm to find both the maximum and minimum of 380 distinct numbers that uses at most 568 comparisons.

Algorithm to merge the lists together, Q. Let X = (X1, X2, X3,....Xn) and Y... Q. Let X = (X1, X2, X3,....Xn) and Y= (Y1, Y2, Y3,....Xm) be the two linked lists respectively. Write down an algorithm to merge the lists together to get the linked list Z such th

Algorithm for dfs, Step 1: Choose a vertex in the graph and make it the sou... Step 1: Choose a vertex in the graph and make it the source vertex & mark it visited. Step 2: Determine a vertex which is adjacent to the source vertex and begun a new search if

For loop, for (i = 0; i sequence of statements } Here, the loop e... for (i = 0; i sequence of statements } Here, the loop executes n times. Thus, the sequence of statements also executes n times. Since we suppose the time complexity of th

Define container in terms of object-oriented terms, Define container in te... Define container in terms of  object-oriented terms A Container is a broad category whose instances are all more specific things; there is never anything which is just a Contai