Angelina Veni
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:
- SPOJ : AE1B
- UVA 10474: Where is the Marble? [V]
- UVA 10041 : Vito’s Family [V]
- OSN 2009 #3 : Sepatu
- UVA 299 : Train Swapping
- UVA 10327 : Flip Sort
- SPOJ : CPRMT [V]
to be added : source code masing2 algo, more problems, detailed explanation
Tweet4 Responses to Pengurutan
Leave a Reply to Angelina Veni Cancel reply
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License (you're required to link to this blog whenever you republish my content).
Mana ini penjelasan detailnya?
belom sempet
lagi sibuk ujian2 euy..
@mr_ark: sementara saya upload tutorial sorting dari TOKI dulu, mudah2an membantu
Testcase nya juga donk ven!…. hehehehe