What are the 5 ways of writing an algorithm?

Answer 1

for the most part, programming is writing algorithms. An algorithm is just a sequence of instructions designed to get a desired result.

lets write an algorithm for finding the largest number in a list of numbers:

You have a list called numberList and it has a bunch of random numbers stored in it. The only way you can find the largest number is if you go through every element in numberList. Since we don't know anything about any of the numbers in numberList (they could all be the same) lets just call the first element in the list our currentLargest. As we traverse through numberList, if we come across a number larger than our currentLargest then we assign the new number as our currentLargest. Once we have looked at every element in the numberList, our currentLargest should be the largest number in numberList.

The code for the above program would look something like this [Pseudocode]:

numberList = {1, 39, 8, 109, ...}

currentLarget = numberList0

FOR every element in numberList

. . . IF element > currentLargest

. . . . . . currentLargest = element

PRINT currentLargest

Answer 2

An algorithm is a set of steps used to solve a specific problem. So in order to make one, you need to identify a problem and figure out a solution to that problem. Write down the solution in a step-by-step manner and you have yourself an algorithm.

Answer 3

The process of writing an algorithm is just taking your problem, and breaking it down, abstracting it to be able to be solved without a computer. Then you can translate those steps into code.

Quickly, the best reference I can point you to would be Banfa's Tutorial

[ http://bytes.com/topic/c/insights/641516-tutorial-1-what-programming ]

over in the C/C++ Articles Section.

Have a look at a recipe for baking a cake; it's a set of instructions that you should

follow/perform in order to obtain a cake without buying one. Algorithms are

similar sets of instructions for computers.

Answer 4

Any algorithm, that refers to itself is recursive.

Trivial example:

gcd (a, b) :=

a if b=0

b if a=0

gcd (a mod b, b) if a>=b

gcd (b mod a, a) if a<b

Answer 5

an algorithm is just a detailed sequence of simple steps thst are needed to solve a problem,

Answer 6

Algorithms are generally written on a piece of paper.

Answer 7

1. Natural language
2. Flow chart
3. Pseudocode
4. Programming language

There is no fifth method.