Menghitung worst case, best case, average case dari algoritma mencari bilngan prima

bil_prima

Deklarasi

 i,bil,b :interger

Algoritma

b←0

input(bil)

for i ←1 to bil do

                if (bil mod i = 0)

                                then

                                                b←b+1

                endif

endfor

                if b = 2

                                then

                                                output(bil,”bilangan prima”)

                                else

                                                output(bil,”bukan bilangan prima”)

                endif

               

Worst case, Best case, Average case

 

T_min(n) = 2

T_max(n) = n +1

   T_avg(n)  = 2  + (n+1) / 2

      ≈  n+1 /2

                    ≈ n