Solusi Tugas 2.pptx Akhmad Nazharasasrdad n

cjbasjdbgasfqufbg sc scnjkvbsdjvbsdjlv sdvjadbcjasdbnvmzxc nvcdnsmcvbadjksbcadjklsvbjkcsx nmcdsx vadhjkscvjkadsviklsdhnvjlwsdhbgjkludefrsbgkvhjdsz vmn,cszbvjkludswbvkjlucsb lcsknadqocvjndwilvbniklfgnbdwfjdwczxn, vj,sxcbvsdjiklcnviladsbvkcdhs vcxkmsh dsjlvadsliocvbdskhbvcdksjbvsxz,j adsmncv dskjlb

1. Solusi tugas 2 Anstragor Evaluasi Time Complexity T (n)

2. 2 1+ 2*n +n *.. n= len 1+ 2*n +n *2 T(n)=2+ 4*n 1

3. 2 1 1 Max((T(n/2), T(n/2),1) = T(n/2) T(n)=4+T(n/2) T(n)=4+T(n/2)= 4+ 4 + T(n/ 4 ) = 4 + 4 + 4 + T(n/ 8 )= 4 + 4 + 4 + 4 + T(n/ 16 ) = 4 + 4 + 4 + 4 + ..+ T(n/ n ) 4*3=4 log 2 8 4*4=4 log 2 16 4*2=4 log 2 4 4* log 2 n

4. T(n)=4+T(n/2)= 4+ 4 + T(n/ 4 ) = 4 + 4 + 4 + T(n/ 8 )= 4 + 4 + 4 + 4 + T(n/ 16 ) = 4 + 4 + 4 + 4 + ..+ T(n/ n ) 4*3=4 log 2 8 4*4=4 log 2 16 4*2=4 log 2 4 4* log 2 n 32 16 8 4 2 5 = log 2 32

5. 2 1 1+ Max( 1,1,1)=2 3* f(n) 1 T(n)= 3+ 3*f(n)

6. 32 16 8 4 2 5 = log 2 32 low high mid low low low low high high high Low=high