Write a computer algorithm to test whether a relation R defined on a finite set A is symmetric, where

A = { a [ 1 ] , a [ 2 ] , .... , a [ n ] }

To write a computer algorithm to test whether a relation R defined on a finite set A is symmetric or not, where A={a[1],a[2],...,a[n]}.

Given information:

A={a[1],a[2],...,a[n]}.

Calculation:

We need to create an algorithm that will check if some relation is symmetric. The input will be a relation R on a set A={a|1|,a|2|,...,a|n|}

Input:

A={a[1],a[2],...,a[n]},R[a relation on the set A]

For each pair of elements (a,b) in R, if we will need to check if (b,a)∈R. If we find some (a,b)∈R such that (b,a)∉R, then the algorithm will need to return that the relation is not symmetric, else the algorithm will need to return that the relation is symmetric.

Algorithm body:

answer:="symmetric"i:=1

while i≤n and answer="symmetric"

j:=1

while j≤n and answer="symmetric"

if (a[i],a[j])∈R