What's the fastest way to alphabetize your bookshelf? - Chand John

3,904,772 views

2016-11-28 ใƒป TED-Ed


New videos

What's the fastest way to alphabetize your bookshelf? - Chand John

3,904,772 views ใƒป 2016-11-28

TED-Ed


์•„๋ž˜ ์˜๋ฌธ์ž๋ง‰์„ ๋”๋ธ”ํด๋ฆญํ•˜์‹œ๋ฉด ์˜์ƒ์ด ์žฌ์ƒ๋ฉ๋‹ˆ๋‹ค.

๋ฒˆ์—ญ: Evee Kim ๊ฒ€ํ† : Jihyeon J. Kim
00:06
You work at the college library.
0
6911
2266
๋‹น์‹ ์€ ๋Œ€ํ•™ ๋„์„œ๊ด€์—์„œ ์ผํ•ฉ๋‹ˆ๋‹ค.
00:09
You're in the middle of a quiet afternoon
1
9177
2220
์กฐ์šฉํ•œ ์˜คํ›„,
00:11
when suddenly a shipment of 1,280 different books arrives.
2
11397
6614
๊ฐ‘์ž๊ธฐ 1,280๊ถŒ์˜ ๋‹ค์–‘ํ•œ ์ฑ…๋“ค์ด ๋ฐฐ์†ก๋˜์—ˆ์Šต๋‹ˆ๋‹ค.
00:18
The books have been dropped of in one long straight line,
3
18011
3679
์ฑ…๋“ค์€ ํ•œ์ค„๋กœ ๊ธธ๊ฒŒ ๋†“์•„์กŒ์ง€๋งŒ
00:21
but they're all out of order,
4
21690
1598
์ •๋ˆ๋˜์–ด ์žˆ์ง€๋Š” ์•Š์•˜๊ณ 
00:23
and the automatic sorting system is broken.
5
23288
3743
์ž๋™ ๋ถ„๋ฅ˜ ์‹œ์Šคํ…œ์€ ๋ง๊ฐ€์กŒ์Šต๋‹ˆ๋‹ค.
00:27
To make matters worse, classes start tomorrow,
6
27031
2636
๋” ์‹ฌ๊ฐํ•œ ๋ฌธ์ œ๋Š” ๋‚ด์ผ ์ˆ˜์—…์ด ๊ณง ์‹œ์ž‘๋˜๋Š”๋ฐ
00:29
which means that first thing in the morning,
7
29667
2338
์ด๋Š” ๊ณง ๋‚ด์ผ ์•„์นจ์ด ๋˜์ž ๋งˆ์ž
00:32
students will show up in droves looking for these books.
8
32005
4552
ํ•™์ƒ๋“ค์ด ๋–ผ์ง€์–ด ์™€์„œ ์ฑ…๋“ค์„ ์ฐพ๋Š๋‹ค๋Š” ๊ฒ๋‹ˆ๋‹ค.
00:36
How can you get them all sorted in time?
9
36557
2936
์–ด๋–ป๊ฒŒ ๋‹น์‹ ์€ ์ œ ๋ชจ๋“  ์ฑ…๋“ค์„ ์ œ ์‹œ๊ฐ„ ์•ˆ์— ์ •๋ฆฌํ•  ์ˆ˜ ์žˆ์„๊นŒ์š”?
00:39
One way would be to start at one end of the line with the first pair of books.
10
39493
5286
ํ•œ ๋ฐฉ๋ฒ•์€ ํ•œ์ชฝ ๋์— ์žˆ๋Š” ์ฑ…๋ถ€ํ„ฐ ์‹œ์ž‘ํ•˜๋Š” ๊ฒ๋‹ˆ๋‹ค.
00:44
If the first two books are in order, then leave them as they are.
11
44779
3847
๋งŒ์•ฝ ์ฒซ ๋‘ ์ฑ…์ด ์ˆœ์„œ๋Œ€๋กœ ์žˆ๋‹ค๋ฉด, ๊ทธ๋Œ€๋กœ ๋‘๋ฉด ๋ฉ๋‹ˆ๋‹ค.
00:48
Otherwise, swap them.
12
48626
2294
๊ทธ๊ฒŒ ์•„๋‹ˆ๋ผ๋ฉด ๋ฐ”๊พธ๋ฉด ๋ฉ๋‹ˆ๋‹ค.
00:50
Then, look at the second and third books,
13
50920
2296
๊ทธ๋ฆฌ๊ณ ๋Š” ๋‘ ๋ฒˆ์งธ์™€ ์„ธ ๋ฒˆ์งธ์˜ ์ฑ…์„ ๋ณด๊ณ 
00:53
repeat the process,
14
53216
1663
๊ทธ ๊ณผ์ •์„ ๋ฐ˜๋ณตํ•˜๋ฉด ๋ฉ๋‹ˆ๋‹ค.
00:54
and continue until you reach the end of the line.
15
54879
3056
๊ทธ๋ฆฌ๊ณ  ๊ทธ๋ ‡๊ฒŒ ๋งˆ์ง€๋ง‰ ์ฑ…๊นŒ์ง€ ๊ณ„์†ํ•˜๋Š” ๊ฑฐ์ฃ .
00:57
At some point, you'll come across the book that should be last,
16
57935
3250
์–ด๋Š ์‹œ์ ์—์„œ, ๋‹น์‹ ์€ ๊ฐ€์žฅ ๋งˆ์ง€๋ง‰์œผ๋กœ ๊ฐ€์•ผ ํ•  ์ฑ…์„ ๋งŒ๋‚˜๊ฒŒ ๋  ๊ฒƒ์ด๊ณ ,
01:01
and keep swapping it with every subsequent book,
17
61185
3525
๊ทธ ์ฑ…์„ ๋งค๋ฒˆ ๋‹ค๋ฅธ ์ฑ…๋“ค๊ณผ ์ˆœ์„œ๋ฅผ ๋ฐ”๊ฟ”
01:04
moving it down the line until it reaches the end where it belongs.
18
64710
4570
๊ทธ ์ฑ…์ด ์ œ์ž๋ฆฌ์— ๋„์ฐฉํ•  ๋•Œ๊นŒ์ง€ ๊ณ„์†ํ•ด์„œ ๋’ค๋กœ ์˜ฎ๊ธธ ๊ฒ๋‹ˆ๋‹ค.
01:09
Then, start from the beginning and repeat the process
19
69280
2945
๊ทธ๋ฆฌ๊ณ  ๋‹ค์‹œ ๋งจ ์ฒ˜์Œ์œผ๋กœ ๊ฐ€ ์ด๋ฅผ ๋ฐ˜๋ณตํ•˜๋ฉด์„œ
01:12
to get the second to last book in its proper place,
20
72225
3285
๋’ค์—์„œ ๋‘ ๋ฒˆ์งธ๋กœ ์˜ฌ ์ฑ…์„ ์ œ์ž๋ฆฌ๋กœ ์˜ฎ๊ธฐ๊ณ 
01:15
and keep going until all books are sorted.
21
75510
3311
๋ชจ๋“  ์ฑ…๋“ค์ด ์ •๋ฆฌ๋  ๋•Œ๊นŒ์ง€ ๊ณ„์†ํ•ฉ๋‹ˆ๋‹ค.
01:18
This approach is called Bubble Sort.
22
78821
3041
์ด๋Ÿฌํ•œ ๋ฐฉ์‹์„ ๊ฑฐํ’ˆ์ •๋ ฌ์ด๋ผ๊ณ  ํ•ฉ๋‹ˆ๋‹ค.
01:21
It's simple but slow.
23
81862
2294
๊ฐ„๋‹จํ•˜์ง€๋งŒ ๋Š๋ฆฐ ๋ฐฉ๋ฒ•์ด์ฃ .
01:24
You'd make 1,279 comparisons in the first round,
24
84156
5175
๋‹น์‹ ์€ ์ฒซ ๋ฒˆ์งธ ์ •๋ ฌ์—์„œ 1,279๋ฒˆ์„ ๋น„๊ตํ•  ๊ฒƒ์ด๊ณ 
01:29
then 1,278, and so on,
25
89331
4292
๊ทธ๋‹ค์Œ์—๋Š” 1,278๋ฒˆ์„, ๊ทธ๋ฆฌ๊ณ  ๊ทธ ํ›„์—๋„ ์ด์™€ ๊ฐ™์ด
01:33
adding up to 818,560 comparisons.
26
93623
4919
๊ฒฐ๊ตญ์—๋Š” ์ด 818,560๋ฒˆ์˜ ๋น„๊ต๋ฅผ ํ•˜๊ฒŒ ๋ฉ๋‹ˆ๋‹ค.
01:38
If each took just one second, the process would take over nine days.
27
98542
5731
๋งŒ์•ฝ ๋น„๊ต ํ•œ๋ฒˆ์ด 1์ดˆ๊ฐ€ ๊ฑธ๋ ธ๋‹ค๋ฉด, ์ด ๊ณผ์ •์€ 9์ผ์ด ๋„˜๊ฒŒ ๊ฑธ๋ฆด ๊ฒ๋‹ˆ๋‹ค.
01:44
A second strategy would be to start by sorting just the first two books.
28
104273
4296
๋‘ ๋ฒˆ์งธ ์ „๋žต์€ ์ฒ˜์Œ ๋‘ ์ฑ…์„ ์ •๋ฆฌํ•˜๋Š” ๊ฒƒ์œผ๋กœ ์‹œ์ž‘ํ•ฉ๋‹ˆ๋‹ค.
01:48
Then, take the third book and compare it with the book in the second spot.
29
108569
5164
๊ทธ๋ฆฌ๊ณ  ์„ธ ๋ฒˆ์งธ ์ฑ…์„ ๊ฐ€์ ธ์™€ ๋‘ ๋ฒˆ์งธ ์ž๋ฆฌ์— ์žˆ๋Š” ์ฑ…๊ณผ ๋น„๊ตํ•ฉ๋‹ˆ๋‹ค.
01:53
If it belongs before the second book, swap them,
30
113733
3440
๋งŒ์•ฝ ์ด๊ฒƒ์ด ๋‘ ๋ฒˆ์งธ ์ฑ… ์•ž์œผ๋กœ ๊ฐ€์•ผํ•œ๋‹ค๋ฉด ๋ฐ”๊พธ๊ณ 
01:57
then compare it with the book in the first spot,
31
117173
2468
์ฒซ ๋ฒˆ์งธ ์ž๋ฆฌ์— ์žˆ๋Š” ์ฑ…๊ณผ๋„ ๋น„๊ตํ•œ ๋’ค
01:59
and swap again if needed.
32
119641
2041
๋” ์•ž์œผ๋กœ ๊ฐ€์•ผํ•œ๋‹ค๋ฉด ๋˜ ์œ„์น˜๋ฅผ ๋ฐ”๊ฟ‰๋‹ˆ๋‹ค.
02:01
Now you've sorted the first three books.
33
121682
2198
์ด์ œ ๋‹น์‹ ์€ ์ฒ˜์Œ 3๊ถŒ์„ ์ •๋ ฌํ–ˆ์Šต๋‹ˆ๋‹ค.
02:03
Keep adding one book at a time to the sorted sub-line,
34
123880
3852
๊ณ„์†ํ•ด์„œ ์•ž์„œ ์ •๋ˆ ๋œ ์ฑ…๋“ค์— ๋งž์ถฐ ๋‹ค์Œ ์ฑ…์„ ํ•œ ๊ถŒ ์”ฉ ์ถ”๊ฐ€ํ•˜๊ณ 
02:07
comparing and swapping the new book with the one before it
35
127732
4077
์ƒˆ์ฑ…์„ ๊ทธ๊ฒƒ ์ „์˜ ์ฑ… ํ•œ๊ถŒ๊ณผ ๋น„๊ตํ•˜๊ณ  ๋ฐ”๊พธ๋ฉฐ
02:11
until it's correctly placed among the books sorted so far.
36
131809
4195
์ง€๊ธˆ๊นŒ์ง€ ์ •๋ˆ ๋œ ์ฑ…๋“ค ์‚ฌ์ด์—์„œ ์•Œ๋งž์€ ์œ„์น˜์— ์ž๋ฆฌ ํ•  ๋•Œ๊นŒ์ง€ ๋ฐ˜๋ณตํ•ฉ๋‹ˆ๋‹ค.
02:16
This is called Insertion Sort.
37
136004
2209
์ด๊ฒƒ์€ ์‚ฝ์ž…์ •๋ ฌ ์ด๋ผ๊ณ  ํ•ฉ๋‹ˆ๋‹ค.
02:18
Unlike Bubble Sort, it usually doesn't require comparing every pair of books.
38
138213
4731
๊ฑฐํ’ˆ์ •๋ ฌ๊ณผ๋Š” ๋‹ฌ๋ฆฌ, ์ด๋Š” ๋ชจ๋“  ์ฑ…์„ ์ผ์ผ์ด ๋น„๊ตํ•  ํ•„์š”๊ฐ€ ์—†์Šต๋‹ˆ๋‹ค.
02:22
On average, we'd expect to only need to compare each book
39
142944
4010
ํ‰๊ท ์ ์œผ๋กœ , ์šฐ๋ฆฌ๋Š” ๊ฐ ์ฑ…์— ์žˆ์–ด์„œ ์ด๋ฏธ ์ •๋ˆํ•ด ๋‘” ์ฑ…์˜
02:26
to half of the books that came before it.
40
146954
2460
์ ˆ๋ฐ˜๋งŒ์„ ๋น„๊ตํ•˜๋ฉด ๋œ๋‹ค๊ณ  ์˜ˆ์ธกํ•  ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.
02:29
In that case, the total number of comparisons
41
149414
2709
์ด ๊ฒฝ์šฐ, ์ „์ฒด ๋น„๊ต ํšŸ์ˆ˜๋Š”
02:32
would be 409,280,
42
152123
3860
409,280๋ฒˆ์ด ๋˜๊ณ ,
02:35
taking almost five days.
43
155983
2152
์ด๋Š” ๊ฑฐ์˜ 5์ผ์ด ๊ฑธ๋ฆฝ๋‹ˆ๋‹ค.
02:38
You're still doing way too many comparisons.
44
158135
2489
๋‹น์‹ ์€ ์•„์ง๋„ ๋„ˆ๋ฌด ๋งŽ์€ ๋น„๊ต๋ฅผ ํ•˜๊ณ  ์žˆ์Šต๋‹ˆ๋‹ค.
02:40
Here's a better idea.
45
160624
1891
์—ฌ๊ธฐ ๋” ์ข‹์€ ์ƒ๊ฐ์ด ์žˆ์Šต๋‹ˆ๋‹ค.
02:42
First, pick a random book.
46
162515
2370
๋จผ์ €, ์ฑ… ํ•œ ๊ถŒ์„ ๋ฌด์ž‘์œ„๋กœ ๋ฝ‘์œผ์„ธ์š”.
02:44
Call it the partition and compare it to every other book.
47
164885
4721
๊ทธ๊ฒƒ์„ ๊ธฐ์ค€์ด๋ผ ๋ถ€๋ฅด๊ณ  ์ด๊ฒƒ์„ ๋‹ค๋ฅธ ๋ชจ๋“  ์ฑ…๋“ค๊ณผ ๋น„๊ตํ•ด ๋ณด์„ธ์š”.
02:49
Then, divide the line
48
169606
1909
๊ทธ๋ฆฌ๊ณ  ๋‘˜๋กœ ๋‚˜๋ˆ„์–ด์„œ
02:51
by placing all the books that come before the partition on its left
49
171515
4151
๊ธฐ์ค€๋ณด๋‹ค ์•ž์— ์˜ค๋Š” ์ฑ…๋“ค์€ ์™ผ์ชฝ์— ์ •๋ˆํ•˜๊ณ 
02:55
and all the ones that come after it on its right.
50
175666
3159
๊ธฐ์ค€๋ณด๋‹ค ๋’ค์— ์™€์•ผ ํ•˜๋Š” ์ฑ…๋“ค์€ ์˜ค๋ฅธ์ชฝ์— ์ •๋ˆํ•ด๋ด…์‹œ๋‹ค.
02:58
You've just saved loads of time
51
178825
1590
๋‹น์‹ ์€ ๋ฐฉ๊ธˆ ์—„์ฒญ๋‚œ ์‹œ๊ฐ„์„ ์ ˆ์•ฝํ–ˆ์Šต๋‹ˆ๋‹ค.
03:00
by not having to compare any of the books on the left
52
180415
3430
์™œ๋ƒํ•˜๋ฉด ์™ผ์ชฝ์— ์žˆ๋Š” ์–ด๋–ค ์ฑ…๋“ค๊ณผ
03:03
to any of the ones on the right ever again.
53
183845
3400
์˜ค๋ฅธ์ชฝ์— ์žˆ๋Š” ์ฑ…๋“ค์„ ๋น„๊ตํ•  ํ•„์š”๊ฐ€ ์—†๊ธฐ ๋•Œ๋ฌธ์ด์ฃ .
03:07
Now, looking only at the books on the left,
54
187245
2420
์ด์ œ, ์™ผ์ชฝ์— ์žˆ๋Š” ์ฑ…๋“ค๋งŒ ๋ณด๋ฉด
03:09
you can again pick a random partition book
55
189665
2877
๋‹น์‹ ์€ ๋‹ค์‹œ ๋ฌด์ž‘์œ„๋กœ ๊ธฐ์ค€์ด ๋˜๋Š” ์ฑ…์„ ๊ณ ๋ฅด๊ณ 
03:12
and separate those books that come before it from those that come after it.
56
192542
4724
์ฑ…๋“ค์„ ๊ธฐ์ค€ ์ฑ… ์ „๊ณผ ํ›„์— ์˜ค๋Š” ๊ฒƒ์œผ๋กœ ๋‚˜๋ˆŒ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.
03:17
You can keep creating sub-partitions like this
57
197266
2470
์ด๋Ÿฐ ๋ฐฉ์‹์„ ์ด์šฉํ•ด ๊ณ„์†ํ•ด์„œ ๊ธฐ์ค€ ์ฑ…์„ ๋งŒ๋“ค๊ณ 
03:19
until you have a bunch of small sub-lines,
58
199736
2648
์ˆ˜ ๋งŽ์€ ๊ธฐ์ค€ ์ฑ…๋“ค์ด ์ƒ๊ฒผ์„ ๋•Œ
03:22
each of which you'd sort quickly using another strategy, like Insertion Sort.
59
202384
5380
๋‹ค๋ฅธ ์ „๋žต, ์‚ฝ์ž…์ •๋ ฌ์„ ์ด์šฉํ•ด ๋น ๋ฅด๊ฒŒ ์ •๋ ฌํ•  ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.
03:27
Each round of partitioning requires about 1,280 comparisons.
60
207764
5162
์–ด๋ฆผ์žก์•„ 1,280๋ฒˆ ์ •๋„ ๊ธฐ์ค€ ์ฑ…์œผ๋กœ ๋‚˜๋ˆ„๊ฒŒ ๋ฉ๋‹ˆ๋‹ค.
03:32
If your partitions are pretty balanced,
61
212926
2540
๋งŒ์•ฝ ๋‹น์‹ ์˜ ๊ธฐ์ค€ ์ฑ…๋“ค์ด ๊ท ํ˜•์„ ์ž˜ ๋งž๋‹ค๋ฉด
03:35
dividing the books into 128 sub-lines of ten would take about seven rounds,
62
215466
5790
์ฑ…๋“ค์„ 10๊ถŒ ์”ฉ์œผ๋กœ ์ด 128 ๊ตฌ๊ฐ„์„ ๋งŒ๋“œ๋Š” ๋ฐ ์•ฝ 7๋ฒˆ์ด ๊ฑธ๋ฆฌ๋Š”๋ฐ
03:41
or 8,960 seconds.
63
221256
2691
์ด๋Š” ์•ฝ 8,960์ดˆ๊ฐ€ ๊ฑธ๋ฆฝ๋‹ˆ๋‹ค.
03:43
Sorting these sub-lines would add about 22 seconds each.
64
223947
4789
๊ตฌ๊ฐ„ ์•ˆ์˜ ์ฑ…๋“ค์„ ์ •๋ฆฌํ•˜๋Š” ๋ฐ๋Š” ์•„๋งˆ 22์ดˆ ์ฏค ๊ฑธ๋ฆด ๊ฒ๋‹ˆ๋‹ค.
03:48
All in all, this method known as QuickSort
65
228736
3081
์ „์ฒด์ ์œผ๋กœ ์ด ๋ฐฉ๋ฒ•์€ ํ€ต์ •๋ ฌ์ด๋ผ๊ณ  ์•Œ๋ ค์ ธ ์žˆ์œผ๋ฉฐ
03:51
could sort the books in under three and a half hours.
66
231817
3066
๋ชจ๋“  ์ฑ…์„ 3์‹œ๊ฐ„ ๋ฐ˜ ๋งŒ์— ์ •๋ ฌํ•  ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.
03:54
But there's a catch.
67
234883
1114
ํ•˜์ง€๋งŒ ์—ฌ๊ธฐ์—” ํ•จ์ •์ด ์žˆ์Šต๋‹ˆ๋‹ค.
03:55
Your partitions could end up lopsided, saving no time at all.
68
235997
3578
๊ธฐ์ค€ ์ฑ…์ด ํ•œ์ชฝ์œผ๋กœ ์ ๋ฆด ์ˆ˜ ์žˆ๊ณ , ์ด๋Š” ์ „ํ˜€ ์‹œ๊ฐ„์ ˆ์•ฝ์ด ์•ˆ ๋ฉ๋‹ˆ๋‹ค.
03:59
Luckily, this rarely happens.
69
239575
1902
์šด์ด ์ข‹์€ ๊ฒƒ์€, ์ด ๊ฒฝ์šฐ๋Š” ๋งค์šฐ ๋“œ๋ฌผ๊ฒŒ ์ผ์–ด๋‚ฉ๋‹ˆ๋‹ค.
04:01
That's why QuickSort is one of the most efficient strategies
70
241477
3433
์ด๋Ÿฌํ•œ ์ด์œ ๋กœ ํ€ต์ •๋ ฌ์€ ํ”„๋กœ๊ทธ๋ž˜๋จธ๋“ค์ด ์ด์šฉํ•˜๋Š”
04:04
used by programmers today.
71
244910
2006
๊ฐ€์žฅ ํšจ์œจ์ ์ธ ์ „๋žต ์ค‘ ํ•˜๋‚˜์ฃ .
04:06
They use it for things like sorting items in an online store by price,
72
246916
3931
ํ”„๋กœ๊ทธ๋ž˜๋จธ๋“ค์€ ์˜จ๋ผ์ธ ์‡ผํ•‘๋ชฐ์—์„œ ๋ฌผ๊ฑด๋“ค์„ ๊ฐ€๊ฒฉ์— ๋งž์ถฐ ์ •๋ ฌํ•˜๊ฑฐ๋‚˜
04:10
or creating a list of all the gas stations close to a given location
73
250847
4011
์ฃผ์–ด์ง„ ์žฅ์†Œ ์ฃผ๋ณ€์˜ ๋ชจ๋“  ์ฃผ์œ ์†Œ๋“ค ๊ฑฐ๋ฆฌ์— ๋”ฐ๋ผ
04:14
sorted by distance.
74
254858
1521
์ •๋ ฌํ•˜๋Š” ๋ฐ ์ด์šฉํ•ฉ๋‹ˆ๋‹ค.
04:16
In your case, you're done quick sorting with time to spare.
75
256379
4028
๋‹น์‹ ์˜ ๊ฒฝ์šฐ์—๋Š”, ํ€ต์ •๋ ฌ๋กœ ๋๋‚ด๊ณ  ์—ฌ์œ ์‹œ๊ฐ„๋„ ๊ฐ€์งˆ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.
04:20
Just another high-stakes day in the library.
76
260407
2261
์ •์‹ ์—†๋Š” ๋„์„œ๊ด€์—์„œ์˜ ๋˜ ํ•˜๋ฃจ๊ฐ€ ์ง€๋‚˜๊ฐ€๋„ค์š”.
์ด ์›น์‚ฌ์ดํŠธ ์ •๋ณด

์ด ์‚ฌ์ดํŠธ๋Š” ์˜์–ด ํ•™์Šต์— ์œ ์šฉํ•œ YouTube ๋™์˜์ƒ์„ ์†Œ๊ฐœํ•ฉ๋‹ˆ๋‹ค. ์ „ ์„ธ๊ณ„ ์ตœ๊ณ ์˜ ์„ ์ƒ๋‹˜๋“ค์ด ๊ฐ€๋ฅด์น˜๋Š” ์˜์–ด ์ˆ˜์—…์„ ๋ณด๊ฒŒ ๋  ๊ฒƒ์ž…๋‹ˆ๋‹ค. ๊ฐ ๋™์˜์ƒ ํŽ˜์ด์ง€์— ํ‘œ์‹œ๋˜๋Š” ์˜์–ด ์ž๋ง‰์„ ๋”๋ธ” ํด๋ฆญํ•˜๋ฉด ๊ทธ๊ณณ์—์„œ ๋™์˜์ƒ์ด ์žฌ์ƒ๋ฉ๋‹ˆ๋‹ค. ๋น„๋””์˜ค ์žฌ์ƒ์— ๋งž์ถฐ ์ž๋ง‰์ด ์Šคํฌ๋กค๋ฉ๋‹ˆ๋‹ค. ์˜๊ฒฌ์ด๋‚˜ ์š”์ฒญ์ด ์žˆ๋Š” ๊ฒฝ์šฐ ์ด ๋ฌธ์˜ ์–‘์‹์„ ์‚ฌ์šฉํ•˜์—ฌ ๋ฌธ์˜ํ•˜์‹ญ์‹œ์˜ค.

https://forms.gle/WvT1wiN1qDtmnspy7