insertion sort 1
[Algorithm] ์ •๋ ฌ ์•Œ๊ณ ๋ฆฌ์ฆ˜ (Sort Algorithm)

์ •๋ ฌ (Sorting) ? - ์–ด๋–ค ๋ฐ์ดํ„ฐ๋“ค์ด ์ฃผ์–ด์กŒ์„ ๋•Œ, ์ด๋ฅผ ์ •ํ•ด์ง„ ์ˆœ์„œ๋Œ€๋กœ ๋‚˜์—ดํ•˜๋Š” ๊ฒƒ - ์ •๋ ฌ์€ ํ”„๋กœ๊ทธ๋žจ ์ž‘์„ฑ ์‹œ, ๋นˆ๋ฒˆํ•˜๊ฒŒ ํ•„์š” - ๋‹ค์–‘ํ•œ ์•Œ๊ณ ๋ฆฌ์ฆ˜์ด ๊ณ ์•ˆ๋˜์—ˆ์œผ๋ฉฐ, ์•Œ๊ณ ๋ฆฌ์ฆ˜ ํ•™์Šต์˜ ํ•„์ˆ˜ ๋ฒ„๋ธ” ์ •๋ ฌ(bubble sort) : ๋‘ ์ธ์ ‘ํ•œ ๋ฐ์ดํ„ฐ๋ฅผ ๋น„๊ตํ•ด์„œ, ์•ž์—์žˆ๋Š” ๋ฐ์ดํ„ฐ๊ฐ€ ๋’ค์—์žˆ๋Š” ๋ฐ์ดํ„ฐ๋ณด๋‹ค ํฌ๋ฉด ์ž๋ฆฌ๋ฅผ ๋ฐ”๊ฟˆ def bubblesort(data): for index in range(len(data) - 1 ): swap = False for index2 in range(len(data) - index - 1): if data[index2] > data[index2 + 1]: data[index2], data[index2 + 1] = data[index2 + 1], data[index2] swap..
์•Œ๊ณ ๋ฆฌ์ฆ˜ 2024.01.30
1
๋”๋ณด๊ธฐ

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