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 :D

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


4 Responses to Pengurutan

  1. mr_ark says:

    Mana ini penjelasan detailnya?

  2. Riko says:

    Testcase nya juga donk ven!…. hehehehe

Leave a Reply

Your email address will not be published. Required fields are marked *


You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>

Set your Twitter account name in your settings to use the TwitterBar Section.