๐Ÿ“šSTUDY/๐Ÿ’พ์ž๋ฃŒ๊ตฌ์กฐ

00. ์ž๋ฃŒ๊ตฌ์กฐ

ํ•ด๋Š”์„  2020. 2. 21. 22:13

 

์ž๋ฃŒ๊ตฌ์กฐ ์นดํ…Œ๊ณ ๋ฆฌ๋Š” '2020 ์ž๋ฃŒ๊ตฌ์กฐ ๋ฐ ์‹ค์Šต' ๊ณผ๋ชฉ์— ๋Œ€๋น„ํ•˜๊ธฐ ์œ„ํ•ด ๋ฏธ๋ฆฌ ๊ฐ•์˜ ๊ณ„ํš์„œ๋ฅผ ๋”ฐ๋ผ ์˜ˆ์Šต ๋ชฉ์ ์œผ๋กœ ๋งŒ๋“ค์—ˆ์Šต๋‹ˆ๋‹ค.

(์ž˜ ์ •๋ฆฌ๋˜๋ฉด ์‹œํ—˜ ๋•Œ ์š”์•ฝ๋ณธ์œผ๋กœ ์จ์•ผ์ง€)

 


์•„๋ž˜์™€ ๊ฐ™์€ ์ž๋ฃŒ ๊ตฌ์กฐ๋“ค์„ ๋‹ค๋ฃฐ ์˜ˆ์ •์ž…๋‹ˆ๋‹ค.

 

1. lists: array, stack, queue, structure, linked list

2. trees: introduction, tree traversal, binary trees, binary expression trees

3. trees: binary search trees, height-balanced trees, AVL tree, performance

4. internal sorting: insertion sort, selection sort, merge sort, quick sort, performance

5. binary search, static hashing

6. graphs: traversal, minimum spanning tree, graph traversal algorithms

7. trees: tries, spatial trees, multidimensional trees

8. external sorting and search, external merge sort, dynamic hashing, B-tree

 

 

์ง์ ‘ ์ˆ˜์—…์„ ๋“ค์€ ํ›„์—, ์ •๋ฆฌํ–ˆ๋˜ ์ž๋ฃŒ์˜ ๋‚ด์šฉ์„ ์ˆ˜์ •ํ•  ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.