Pengurutan

Harus dikuasai:
  • algoritma O(n) : counting sort
  • algoritma O(n log n) : merge sort atau quicksort
  • algoritma O(n^2) : bubble sort, selection sort, insertion sort
  • *paling nggak dari setiap kompleksitas bisa salah 1 aja ud cukup, kalo perlu quicksortnya hafalin aja 😀
Latihan:

to be added : source code masing2 algo, more problems, detailed explanation

Advertisements

4 Responses to Pengurutan

  1. mr_ark says:

    Mana ini penjelasan detailnya?

  2. Riko says:

    Testcase nya juga donk ven!…. hehehehe

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 )

Connecting to %s

%d bloggers like this: