answersLogoWhite

0

What are importance of algorithm?

Updated: 10/31/2022
User Avatar

Wiki User

16y ago

Best Answer

Algorithms are the foundation of computer Science, it is telling the computer to do the task in the most efficient matter. An algorithm is particularly important in optimizing a computer program, the efficiency of the algorithm usually determines the efficiency of the program as a whole.

User Avatar

Wiki User

16y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What are importance of algorithm?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What does the service PageRank do?

Actually PageRank is an algorithm used to rank the content of web pages. This algorithm is the main part of today's Google engine and used to rank the importance of web pages.


What is the importance of stack algorithm in your program?

Stack implementations allow us to easily implement backtracking algorithms.


What is the importance of analysis in the design of an algorithm?

There are two main reasons we analyze an algorithm: correctness and efficiency. By far the most important reason to analyze an algorithm is to make sure it will correctly solve your problem. If our algorithm doesn't work, nothing else matters. So we must analyze it to prove that it will always work as expected. We must also look at the efficiency of our algorithm. If it solves our problem, but does so in O(nn) time (or space!), then we should probably look at a redesign.


How are the expanded algorithm and the standard algorithm different?

They are different because standard algorithm is more common then the expanded algorithm


What is algorithm to write algorithm to the program to access a pointer variable in structure?

Here is the algorithm of the algorithm to write an algorithm to access a pointer in a variable. Algorithmically.name_of_the_structure dot name_of_the _field,eg:mystruct.pointerfield


What is the Dijkstra's algorithm?

Dijkstra's algorithm has importance when you are trying to find the shortest path between two points. It's used in the computer networking field where routing protocols, like OSPF, uses it to find the shortest path between routers. http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm


Which algorithm is more efficient lamport bakery algorithm or black and white bakery algorithm?

Black and White bakery algorithm is more efficient.


What is complsexity of an algorithm?

Complexity of an algorithm is a measure of how long an algorithm would take to complete given


Who is the inventor of Reverse Delete Algorithm for MST When was this first published?

The Reverse Delete Algorithm for finding the Minimum Spanning Tree was first introduced by Edsger Dijkstra in 1959. He presented this algorithm in his paper titled "A note on two problems in connexion with graphs" which was published in Numerische Mathematik.


How algorithm is different from flowchart?

An algorithm is a series of steps leading to a result. A flowchart can be a graphical representation of the algorithm.


How do you test algorithm?

By preparing test cases we can test an algorithm. The algorithm is tested with each test case.


List down the names of any three parameters on which you analyze an algorithm?

what is algorithm and its use there and analyze an algorithm