Algorithm for Functions

Algorithm LargestNumber

Input: A non-empty list of numbers L.
Output: The largest number in the list L.


largest ← L0
for each item in the list (Length(L)≥1), do
if the item > largest, then
largest ← the item
return largest


--------------------------------------------------
Algorithm for Sorting using function


procedure bubbleSort( A : list of sortable items ) defined as:
do
swapped := false
for each i in 0 to length(A) - 2 inclusive do:
if A[i] > A[i+1] then
swap( A[i], A[i+1] )
swapped := true
end if
end for
while swapped
end procedure

--------------------------------------------------
function factorial is:
input: integer n such that n >= 0
output: [n × (n-1) × (n-2) × … × 1]

1. create new variable called running_total with a value of 1

2. begin loop
1. if n is 0, exit loop
2. set running_total to (running_total × n)
3. decrement n
4. repeat loop

3. return running_total

end factorial

-------------------------------------------------------