ํ‹ฐ์Šคํ† ๋ฆฌ ๋ทฐ

๋ฐ˜์‘ํ˜•

์ž๋ฃŒ๊ตฌ์กฐ (data structures) ์ด๋ž€?

 

# max๋ฅผ ์‹คํ–‰ํ•˜๋Š”๋ฐ ๊ฑธ๋ฆฌ๋Š” ์‹œ๊ฐ„ ์•Œ์•„๋ณด๊ธฐ
import time

n = int(input("Number of elements: "))
haystack = [k for k in range(n)]

print("Searching for the maximum value...")

ts = time.time()
maximum = max(haystack)
elapsed = time.time() - ts

print("Maximum element = %d, Elapsed time = %.2f" %(maximum, elapsed))

 

์•Œ๊ณ ๋ฆฌ์ฆ˜ (algorithm) ์ด๋ž€?

  • ์‚ฌ์ „์  ์ •์˜ - ์–ด๋–ค ๋ฌธ์ œ๋ฅผ ํ•ด๊ฒฐํ•˜๊ธฐ ์œ„ํ•œ ์ ˆ์ฐจ, ๋ฐฉ๋ฒ•, ๋ช…๋ น์–ด๋“ค์˜ ์ง‘ํ•ฉ
  • ํ”„๋กœ๊ทธ๋ž˜๋ฐ - ์ฃผ์–ด์ง„ ๋ฌธ์ œ์˜ ํ•ด๊ฒฐ์„ ์œ„ํ•œ ์ž๋ฃŒ๊ตฌ์กฐ์™€ ์—ฐ์‚ฐ ๋ฐฉ๋ฒ•์— ๋Œ€ํ•œ ์„ ํƒ

 

ํ•ด๊ฒฐํ•˜๊ณ ์ž ํ•˜๋Š” ๋ฌธ์ œ์— ๋”ฐ๋ผ (์‘์šฉ ์ข…๋ฅ˜์™€ ๋ฒ”์œ„์— ๋”ฐ๋ผ) ์ตœ์ ์˜ ํ•ด๋ฒ•์€ ์„œ๋กœ ๋‹ค๋ฅด๋‹ค. ์ด ์„ ํƒ์„ ์–ด๋–ป๊ฒŒ ํ•ด์•ผํ•˜๋Š๋ƒ๋ฅผ ์•Œ๊ธฐ ์œ„ํ•ด ์ž๋ฃŒ๊ตฌ์กฐ๋ฅผ ์ดํ•ดํ•ด์•ผ ํ•œ๋‹ค.

๋ฐ˜์‘ํ˜•
๋Œ“๊ธ€