Menghitung Worst case, Best case, Average case Algoritma Menghitung Persegi

Menghitung_persegi

Deklarasi

I,j,n : integer

Algoritma

Input(n)

For i← 1 to n do

   For j← 1 to n do

         If (i>j)

                        then

                                    output(“*”)

                        else

                                    output(“ “)

               endif

     endfor

endfor

Worst case, Best case, Average case

T_min(n) = n²

T_max(n) = n²

T_avg(n) = n² ≈ n