๐Ÿ’พ
Home
  • ๋ถ„๋ฅ˜ ์ „์ฒด๋ณด๊ธฐ (54)
    • ๐Ÿ“šSTUDY (51)
      • ๐Ÿ‘“hololens&MRTK (4)
      • ๐Ÿ“œ3D slicer&DICOM&ImageJ (0)
      • ๐Ÿ‘€ coding test๋Œ€๋น„ (4)
      • ๐Ÿ”ฅPytorch ML&DL (14)
      • ๐Ÿ’พ์ž๋ฃŒ๊ตฌ์กฐ (3)
      • ๐ŸŽซDart&Flutter (6)
      • ๐ŸŽ‡๋‹คํ• (dafit.me) (12)
      • CUDA (1)
      • Etc (7)
    • ๐Ÿ“ƒPAPER (2)
    • ๐Ÿ€DAILY (1)
Home
  • ๋ถ„๋ฅ˜ ์ „์ฒด๋ณด๊ธฐ (54)
    • ๐Ÿ“šSTUDY (51)
      • ๐Ÿ‘“hololens&MRTK (4)
      • ๐Ÿ“œ3D slicer&DICOM&ImageJ (0)
      • ๐Ÿ‘€ coding test๋Œ€๋น„ (4)
      • ๐Ÿ”ฅPytorch ML&DL (14)
      • ๐Ÿ’พ์ž๋ฃŒ๊ตฌ์กฐ (3)
      • ๐ŸŽซDart&Flutter (6)
      • ๐ŸŽ‡๋‹คํ• (dafit.me) (12)
      • CUDA (1)
      • Etc (7)
    • ๐Ÿ“ƒPAPER (2)
    • ๐Ÿ€DAILY (1)
๋ธ”๋กœ๊ทธ ๋‚ด ๊ฒ€์ƒ‰
GitHub

๐Ÿ’พ

AtoZ; ์ฒ˜์Œ๋ถ€ํ„ฐ ๋๊นŒ์ง€ ๊ธฐ๋กํ•˜๋ ค๊ณ  ๋…ธ๋ ฅํ•ฉ๋‹ˆ๋‹คโœ

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

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

    2020. 2. 21.

    by. ํ•ด๋Š”์„ 

     

    ์ž๋ฃŒ๊ตฌ์กฐ ์นดํ…Œ๊ณ ๋ฆฌ๋Š” '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

     

     

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

    ์ €์ž‘์žํ‘œ์‹œ (์ƒˆ์ฐฝ์—ด๋ฆผ)

    '๐Ÿ“šSTUDY > ๐Ÿ’พ์ž๋ฃŒ๊ตฌ์กฐ' ์นดํ…Œ๊ณ ๋ฆฌ์˜ ๋‹ค๋ฅธ ๊ธ€

    02. ์ž๋ฃŒ๊ตฌ์กฐ trees: tree traversal, binary trees, binary expression trees  (0) 2020.02.25
    01. ์ž๋ฃŒ๊ตฌ์กฐ lists: array, structure, linked list, stack, queue  (0) 2020.02.22

    ๋Œ“๊ธ€

    ๊ด€๋ จ๊ธ€

    • 02. ์ž๋ฃŒ๊ตฌ์กฐ trees: tree traversal, binary trees, binary expression trees 2020.02.25
    • 01. ์ž๋ฃŒ๊ตฌ์กฐ lists: array, structure, linked list, stack, queue 2020.02.22
    ๋งจ ์œ„๋กœ
์ „์ฒด ๊ธ€ ๋ณด๊ธฐ
Tistory ๋กœ๊ทธ์ธ
Tistory ๋กœ๊ทธ์•„์›ƒ
๋กœ๊ทธ์•„์›ƒ ๊ธ€์“ฐ๊ธฐ ๊ด€๋ฆฌ

Today

Total

์กฐ๊ธˆ์”ฉ ์ฒœ์ฒœํžˆ

Designed by Nana
๋ธ”๋กœ๊ทธ ์ด๋ฏธ์ง€
ํ•ด๋Š”์„ 
๊ธฐ๋ก์„ ๋‚จ๊ธฐ๋ ค๊ณ  ๋…ธ๋ ฅํ•ฉ๋‹ˆ๋‹ค

ํ‹ฐ์Šคํ† ๋ฆฌํˆด๋ฐ”