자료구조와 알고리즘의 관계, 힙

Transcript

1. ੗ܐҳઑ৬ ঌҊ્ܻ नࢲܿ ?
2. ੗ܐҳઑ = ঌҊ્ܻ?
3. ೐۽Ӓ۔ = ੗ܐҳઑ + ঌҊ્ܻ
4. ੑ۱ ୹۱
5. যڌѱ ੷੢? ੗ܐҳઑ
6. যڌѱ ୊ܻ? ঌҊ્ܻ
8. ״ - ظ૑ - ࣗ
9. ࣗ - ظ૑ - ״
10. ࣗ - ظ ૑ - ״
11. ࣗ ظ Ž Ŭ
12. ੗ܐҳઑ
17. ঌҊ્ܻ
18. ই ഒۆझ۞ࠗ۞~
19. ੗ܐҳઑܳ ٜ݅ ٸ, ঌҊ્ܻ੉ ѐੑغযঠೞӝ ٸޙ
21. ௸ ਋ࢶࣽਤ ௸
22. ୭؆ч~ ୭ࣟч~
23. ࠗݽ ֢٘੄ ః ч੉ ੗ध ֢٘੄ ః чࠁ׮ ೦࢚ ௾(੘਷) ੉૓ ౟ܻ
24. 1. ൩ী ࢜۽਍ ਃࣗо ٜয৳׮. 2, ࢜۽਍ ֢٘ח ൩੄ ݃૑݄ ֢٘ী ੉যࢲ ࢗੑೠ׮. 3. ൩੄ ઑѤਸ ݅઒ೡ ٸө૑ ࢜۽਍ ֢٘ܳ ࠗݽ ֢ٜ٘җ Үജೠ׮.
27. // ୭؀ ൩(max heap) ࢗੑ ೣࣻ void insert_max_heap(HeapType *h, element item) { int i; i = ++(h->heap_size); while((i != 1) && (item.key > h->heap[i/2].key)) { h->heap[i] = h->heap[i/2]; i /= 2; } h->heap[i] = item; }
28. 1. ୭؆чੋ ܖ౟֢٘ܳ ࢏ઁೠ׮. 2, ࢏ઁػ ܖ౟֢٘ী ൩੄ ݃૑݄ ֢٘ܳ оઉৡ׮. 3. ൩੄ ઑѤਸ ݅઒ೡ ٸө૑ ੤ҳࢿೠ׮.
32. // ୭؀ ൩(max heap) ࢏ઁ ೣࣻ element delete_max_heap(HeapType *h){ int parent, child; element item, temp; item = h->heap[1]; temp = h->heap[(h->heap_size)--]; parent = 1; child = 2; while(child <= h->heap_size) { if( (child < h->heap_size) && ((h->heap[child].key) < h->heap[child+1].key) ){ child++; } if( temp.key >= h->heap[child].key ){ break; } h->heap[parent] = h->heap[child]; parent = child; child *= 2; } h->heap[parent] = temp; return item; }