DataStructure

Data Structure

์ž๋ฃŒ๊ตฌ์กฐ์˜ ๋ถ„๋ฅ˜

DataStructure
  • ์„ ํ˜•๊ตฌ์กฐ

    : ๋ฐ์ดํ„ฐ๋ฅผ ์ €์žฅํ•  ๋•Œ ์—ฐ์†์ ์ธ ๊ธฐ์–ต ๊ณต๊ฐ„์— ๋ฐฐ์ •ํ•˜๋Š” ์ž๋ฃŒ๊ตฌ์กฐ(๋ฐฐ์—ด, ์Šคํƒ, ํ, ๋ฐํฌ, ์—ฐ๊ฒฐ๋ฆฌ์ŠคํŠธ)

  • ๋น„์„ ํ˜• ๊ตฌ์กฐ

    : ๊ธฐ์–ต ๊ณต๊ฐ„ ๋‚ด์˜ ์œ„์น˜์™€ ๋ณ„๊ฐœ๋กœ ๋…๋ฆฝํ•˜์—ฌ ์ €์žฅํ•˜๋Š” ๊ตฌ์กฐ (ํŠธ๋ฆฌ, ๊ทธ๋ž˜ํ”„)

์‹œ๊ฐ„ ๋ณต์žก๋„

  • ์—ฐ์‚ฐ ์‹œ๊ฐ„์˜ ํฌ๊ธฐ ์ˆœ์„œ

    O(1) < O(logn) < O(n) < O(nlogn) < O(n^2) < O(n^3) < O(2^n) < O(n!)

  • O(1)์ด ๊ฐ€์žฅ ๋น ๋ฅด๋ฉฐ ํ•ด์‰ฌ ๊ฒ€์ƒ‰ ์•Œ๊ณ ๋ฆฌ์ฆ˜์—์„œ ์‚ฌ์šฉ๋œ๋‹ค.

TimeComplexity

Reference : naver d2

Last updated

Was this helpful?