0
As described in the link, an algorithm (the word is based on the name of the Arabic scholar who developed the concept) is a finite list of steps that can be taken in order to solve a specific problem or to produce a certain result. It is important to note that an algorithm does not put you into an infinite loop. There is a path to a final conclusion. It was first developed as a set of procedures for doing arithmetic calculations. Algorithms can be pictured with familiar symbols (see link) like boxes, diamond shapes, circles, etc. connected by arrows showing various points of decision making, and what conclusions can be drawn if you end up at a given point (presuming you followed the 'flow' correctly, and answered the questions accurately-- and also presuming that the algorithm is rigorous.) Of course, the concept is easily applicable to all kinds of engineering and theoretical areas. Algorithms are 'heuristic', meaning that they are seen as basically unjustified, and incapable of justification in and of themselves. This is really a basic and very powerful idea. Heuristics are completely flexible, and they can grow and change as the various conclusions and outcomes are examined. nice answer
An algorithm is the formal declaration of a method of solving a particular problem. It is often used to describe a computer procedure, using words instead of computer instructions, that is computer language independent.
As an example, the binary search algorithm might be stated thusly...
Given an ordered list of elements; in order to find a particular element start by picking the middle element and comparing it against the search target. If found, the search is ended. If not found, subdivide the list into a smaller list, picking either the portion above the selected element or the portion below the selected element, the decision of which being dependent on the initial comparision, highr or lower. Once subdivided, iterate the algorithm from the top. You will eventualy either find the element desired, or you will ultimately select an list of zero length, at which point you abandon the search, but also at which point you know where in the original list to insert the element should you choose to do so.
An algorithm is a set of code that is used to solve a problem.
The function of an algorithm is to describe the step-by-step procedures required to solve a problem using a natural language (e.g., English).
1. Perform the algorithm manually.
2. Write a computer-program for it.
An algorithm is the numbers to be calculated to get an answer to a problem. It is the word problem in its basic numerical form.
Add your answer:
Earn +20 pts
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
Which algorithm is more efficient lamport bakery algorithm or black and white bakery algorithm?
Black and White bakery algorithm is more efficient.
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
What is algorithm evaluation?
evaluation iz same as the testing of an algorithm. it mainly refers to the finding of errors by processing an algorithm..
Is knapsack algorithm is a public key encryption algorithm?
yes
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
Is there any specific formula for finding out that the given numbers are relatively prime?
Euclid's algorithm is probably the most commonly used 'formula' for that purpose. If the greatest common factor is 1, the numbers are relatively prime. See the related question for an example of Euclid's 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
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.
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
How do you test algorithm?
By preparing test cases we can test an algorithm. The algorithm is tested with each test case.
How are expanded algorithm and the standard algorithm different?
Yes
Define algorithm and explain its criteria?
algorithm criteria
What is algorithm evaluation?
evaluation iz same as the testing of an algorithm. it mainly refers to the finding of errors by processing an algorithm..
What is algorithm write properties of algorithm?
An ALGORITHM is a sequence of steps that depicts the program logic independent of the language in which it is to be implemented. An algorithm should be designed with space and time complexities in mind.
