nalyse the following algorithms from the perspective of their efficiency.

Remember that we always follow the same five steps:

$1.$ Identify the input size.

$2.$ Identify the basic operation.

$3.$ Discuss whether the best, worst and average cases are different.

$4.$ Calculate the exact efficiency function $($or functions, if the best, worst and average

cases are different$).$

$5.$ Identify the efficiency class $($or classesLGORITHM IsSorted$($A$[0..$n $1])$

$//$ Returns true if all the numbers in an array A of length n

$//$ are sorted in nondecreasing order, false otherwise.

if n $<=1$

return true

else

for i $0$ to n $2$ do

if A$[$i$]>$ A$[$i $+1]$ return false

return true