Metode Devide and Conquer (D and C)

TEKNIK SEARCHING

Beberapa cara yang bisa digunakan di dalam pencarian data, Tehnik pencarian nilai MaxMin :

  1. Tehnik StraitMaxMin
  2. Teknik D and C
  • Searching dengan tehnik StraitMaxMin

Menentukan/mencari elemen max & min. Pada Himpunan yg berbentuk array linear. Waktu tempuh/time complexity yg digunakan untuk menyelesaikan pencarian hingga mendapatkan solusi yg optimal terbagi atas best case, average case dan worst case.

Download : Metode Devide AND Conquer

Advertisements

About RAN

Lecture, Web Programer
This entry was posted in Logika dan Algoritma Pemograman. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

w

Connecting to %s