numeric unless stated otherwise the alias denotes standard bit integer primality test simple algorithm that determines whether or not given integer is prime numbere and are all prime numbershowever is not as it can be the result of the product of two numbers that are in an attempt to slow down the inner loop the is used as the upper bound algorithm isprime( postn is determined to be prime or not for to do for to sqrt(ndo if return false end if end for end for end isprime base conversions dsa contains number of algorithms that convert base number to its equivalent binaryoctal or hexadecimal form for example has binary representation of table shows the algorithm trace when the number to convert to binary is