๐Ÿ˜Ž ๊ณต๋ถ€ํ•˜๋Š” ์ง•์ง•์•ŒํŒŒ์นด๋Š” ์ฒ˜์Œ์ด์ง€?

[์•Œ๊ณ ๋ฆฌ์ฆ˜] ํ•ด์‹œํ…Œ์ด๋ธ”_๊ตฌํ˜„ ๋ณธ๋ฌธ

๐Ÿ‘ฉ‍๐Ÿ’ป ์ปดํ“จํ„ฐ ๊ตฌ์กฐ/Algorithm

[์•Œ๊ณ ๋ฆฌ์ฆ˜] ํ•ด์‹œํ…Œ์ด๋ธ”_๊ตฌํ˜„

์ง•์ง•์•ŒํŒŒ์นด 2022. 6. 17. 01:43
728x90
๋ฐ˜์‘ํ˜•

220617 ์ž‘์„ฑ

<๋ณธ ๋ธ”๋กœ๊ทธ๋Š” Abdul Bari๋‹˜์˜ ์œ ํŠœ๋ธŒ๋ฅผ ์ฐธ๊ณ ํ•ด์„œ ๊ณต๋ถ€ํ•˜๋ฉฐ ์ž‘์„ฑํ•˜์˜€์Šต๋‹ˆ๋‹ค>

https://www.youtube.com/watch?v=mFY0J5W8Udk 

 

 

1. hash function

h(x) = x %  size hash table

์ถฉ๋Œ ๋ฐœ์ƒ!

 

 

2. collision

- open hasing

chaining

: ๋™์ผํ•œ ํ•ด์‰ฌ ํ•จ์ˆ˜ ์‚ฌ์šฉํ•˜์—ฌ ํ‚ค ๋งคํ•‘ํ•  ๋Œ€!

: ์ƒˆ ์ฒด์ธ์„ ์ถ”๊ฐ€

: ์ฒด์ธ ๋‚ด๋ถ€์˜ ์ธ๋ฑ์Šค ์ƒ์„ฑ

 

- closed hashing

linear probing

: ์ถฉ๋Œํ•˜๋ฉด ๊ทธ๋‹ค์Œ ์—ฌ์œ  ๊ณต๊ฐ„์— ๋„ฃ๊ธฐ

: ์ƒˆ๋กœ์šด ํ•ด์‹œ ํ•จ์ˆ˜ ์ •์˜

h'(x) = [h(x) + h(i)] % size

f(i) = i

: ๋ณด์ˆ˜์ ์ธ ์œ„์น˜์—์„œ ์š”์†Œ ์ฐพ๊ธฐ!!

: ๋นˆ ๊ณต๊ฐ„์— ๋„๋‹ฌํ•  ๋•Œ๊ฐ€์ง€ ๊ฒ€์ƒ‰

: ํด๋Ÿฌ์Šคํ„ฐ๋ง ๋ฌธ์ œ ์•ผ๊ธฐ

 

quadratic probing (2์ฐจ ํƒ์ƒ‰)

: ํด๋Ÿฌ์Šคํ„ฐ๋ง ๋ฌธ์ œ ํ•ด๊ฒฐ

: ์ƒˆ๋กœ์šด ํ•ด์‹œ ํ•จ์ˆ˜ ์ •์˜

h'(x) = [h(x) + h(i)] % size

but f(i) = i^2

728x90
๋ฐ˜์‘ํ˜•
Comments