[B! Sorting] agwã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

agw id:agw

Sortingã«é–¢ã™ã‚‹agwã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (15)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

QDãã‚“âš¡ï¸Python x æ©Ÿæ¢°å¦ç¿’ x é‡‘èžå·¥å¦ on Twitter: "ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®è¨ˆç®—é‡ã®é•ã„ã‚’ã‚ã‹ã‚Šã‚„ã™ãå¯è¦–åŒ–ã—ãŸè¨˜äº‹ ã€Unityã€‘ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 12ç¨®ã‚’å¯è¦–åŒ–ã—ã¦ã¿ãŸ https://t.co/SBT4Xo42ku https://t.co/Cv7GfOvAF2"
agw 2022/08/20
Visualization

Sorting

Algorithm

Programming
ãƒªãƒ³ã‚¯
ã€Unityã€‘ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 12ç¨®ã‚’å¯è¦–åŒ–ã—ã¦ã¿ãŸ - Qiita
ã¯ã˜ã‚ã« ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®å¦ç¿’ã¨ã—ã¦ã€12ç¨®ã®ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’å®Ÿè£…ã—ã¦å¯è¦–åŒ–ã—ã¦ã¿ã¾ã—ãŸã€‚ Unityã«ã¯ã‚ã¾ã‚Šé–¢ä¿‚ãŒãªã•ãã†ãªè©±é¡Œã§ã™ãŒã€Unityä¸Šã§ä½œã£ãŸã®ã§Unityã‚¿ã‚°ã‚’ã¤ã‘ã¾ã™ã€‚ ãƒãƒ–ãƒ«ã‚½ãƒ¼ãƒˆ ãƒãƒ–ãƒ«ã‚½ãƒ¼ãƒˆã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ä»¥ä¸‹ã®ã‚ˆã†ãªæ„Ÿã˜ã§ã™ã€‚ é…åˆ—ã®è¦ç´ ã‚’æœ€åˆã‹ã‚‰æœ€å¾Œã¾ã§è¦‹ã¦ã„ãã€é †åºãŒé€†ã®è¦ç´ ãŒã‚ã‚Œã°å…¥ã‚Œæ›¿ãˆã‚‹ å…¨ã¦ã®è¦ç´ ã®é †åºãŒæ£ã—ããªã‚‹ã¾ã§ 1.ã‚’ç¹°ã‚Šè¿”ã™. void BubbleSort(int[] a) { bool isEnd = false; int finAdjust = 1; // æœ€çµ‚æ·»ãˆå—ã®èª¿æ•´å€¤ while (!isEnd) { bool loopSwap = false; for (int i = 0; i < a.Length - finAdjust; i++) { if (a[i] < a[i + 1]) { Swap(ref a[i],
agw 2022/08/20
Visualization

Sorting

Algorithm

Programming
ãƒªãƒ³ã‚¯
d.y.d.
22:43 21/11/09 ãƒ’ãƒ¼ãƒ—ã‚½ãƒ¼ãƒˆãŒå¥½ãã§ã‚ã‚‹ ranha ã•ã‚“ãŒã€ Approaching Heapsort via Lazy Mergesort ã¨ã„ã†è¨˜äº‹ã‚’å…¬é–‹ã—ã¦ã„ã‚‰ã—ã¦ã€ é…å»¶è©•ä¾¡ã®è¨€èªžã§æ›¸ããƒžãƒ¼ã‚¸ã‚½ãƒ¼ãƒˆã®è¨ˆç®—éŽç¨‹ã§ä½•ãŒèµ·ãã¦ã„ã‚‹ã‹ã‚’è¦‹ã¦ã„ãã¨ã€ ã ã‚“ã ã‚“ãƒ’ãƒ¼ãƒ—ã‚½ãƒ¼ãƒˆãŒè¦‹ãˆã¦ããŸâ€¦ï¼ã¨ã„ã†å¤§å¤‰é¢ç™½ã„è¨˜äº‹ãªã®ã§ã™ãŒã€ ãã®è©±ã®æž•ã«ã€Œç¨²è‘‰ã•ã‚“ã¨ã„ã†ãƒ’ãƒ¼ãƒ—ã‚½ãƒ¼ãƒˆå¤§å¥½ãäººé–“ãŒã„ã‚‹ãŒã„ã£ãŸã„ã©ã“ãŒè‰¯ã„ã®ã‹ã€ ã¨ã„ã†å½¢ã§ç§ãŒç™»å ´ã—ã¦ã„ãŸã®ã§ã€ æ€ã‚ãšä½•æ•…ç§ãŒãƒ’ãƒ¼ãƒ—ã‚½ãƒ¼ãƒˆãŒå¥½ãã§ã‚ã‚‹ã‹ã‚’ã—ãŸãŸã‚ãŸé•·æ–‡ã‚’Twitterã®DMã§ ranhaã•ã‚“ã«é€ã‚Šã¤ã‘ã¦ã—ã¾ã„ã¾ã—ãŸã¨ã„ã†çµŒç·¯ãŒã‚ã‚Šã¾ã™ã€‚ å…ƒãƒã‚¿ã® @pi8027 ã•ã‚“ã®ç™ºè¡¨ ãŒå…¬ã«ãªã£ãŸã®ã«åˆã‚ã›ã¦ranhaã•ã‚“ã®è¨˜äº‹ã‚‚å…¬é–‹ã•ã‚ŒãŸã¿ãŸã„ãªã®ã§ã€ è‡ªåˆ†ã®è„³å†…å‡ºåŠ›ã‚‚ã¤ã„ã§ã«ã“ã“ã«æ›¸ãç•™ã‚ã¦ãŠã“ã†ã‹ã¨æ€ã„ã¾ã—ãŸã€‚ ãŠäºŒæ–¹ã®ã‚ˆã†ã«æŠ€è¡“çš„ã«ã—ã£ã‹
agw 2021/11/10
Sorting

Algorithm

Programming
ãƒªãƒ³ã‚¯
Ryo Suzuki on Twitter: "è©±é¡Œã®ã€Œãªãœã‹ã‚½ãƒ¼ãƒˆã§ãã‚‹ã€ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ Siv3D ã§ã‚¢ãƒ‹ãƒ¡ãƒ¼ã‚·ãƒ§ãƒ³ã«ã—ãŸã€‚ https://t.co/qYmiVIdDsj https://t.co/liNSgo1XL9"
agw 2021/10/08
Sorting

Algorithm
ãƒªãƒ³ã‚¯
ä¸¦åˆ—åŒ–ã«ã‚ˆã‚‹é«˜é€ŸåŒ–
agw 2020/04/26
deferred

Sorting

Concurrency

Programming
ãƒªãƒ³ã‚¯
ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ é«˜é€ŸåŒ–ã¸ã®é“ - kivantiumæ´»å‹•æ—¥è¨˜
å…ˆæ—¥ã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®æŽˆæ¥ã§ã‚½ãƒ¼ãƒˆã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ã„ãã¤ã‹ç¿’ã„ã¾ã—ãŸã€‚ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®åå‰ã¨åŽŸç†ãã‚‰ã„ã¯èžã„ãŸã“ã¨ãŒã‚ã‚Šã¾ã—ãŸãŒã€å®Ÿè£…ã—ãŸã“ã¨ã¯ãªã‹ã£ãŸã®ã§ã„ã„æ©Ÿä¼šã ã¨æ€ã„å®Ÿè£…ã—ã¦ã¿ã‚‹ã“ã¨ã«ã—ã¦ã¿ã¾ã—ãŸã€‚ãŸã å®Ÿè£…ã™ã‚‹ã ã‘ã§ã¯é¢ç™½ããªã„ã®ã§é«˜é€ŸåŒ–ã®é™ç•Œã«æŒ‘æˆ¦ã—ã¦ã¿ãŸã„ã¨æ€ã„ã¾ã™ã€‚ è¨ˆæ¸¬ç”¨ãƒ—ãƒã‚°ãƒ©ãƒ ä»Šå›žã®è¨ˆæ¸¬ã§ã¯ã€ãƒ©ãƒ³ãƒ€ãƒ å€¤ãŒå…¥ã£ãŸé…åˆ—ã®ã‚½ãƒ¼ãƒˆã‚’100å›žè¡Œã„ã€å¹³å‡æ™‚é–“ã‚’å„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ç«¶ã‚ã›ã‚‹ã¨ã„ã†ã‚·ãƒ³ãƒ—ãƒ«ãªãƒ«ãƒ¼ãƒ«ã«ã—ã¾ã—ãŸã€‚ãƒ—ãƒã‚°ãƒ©ãƒ ã¯ä»¥ä¸‹ã®é€šã‚Šã§ã™ã€‚ C++11ã§å…¥ã£ãŸãƒ¡ãƒ«ã‚»ãƒ³ãƒŒãƒ»ãƒ„ã‚¤ã‚¹ã‚¿ãªã©ã®æ©Ÿèƒ½ã‚’ä½¿ã£ã¦ã„ã‚‹ã®ã§ã€ãƒ“ãƒ«ãƒ‰æ™‚ã«ã¯-std=c++11ã‚’æŒ‡å®šã™ã‚‹å¿…è¦ãŒã‚ã‚Šã¾ã™ã€‚ å®Ÿé¨“ã«ä½¿ç”¨ã—ãŸãƒ‘ã‚½ã‚³ãƒ³ã®CPUã¯Core [email protected]ã€ã‚³ãƒ³ãƒ‘ã‚¤ãƒ©ã¯gcc version 4.8.4ã§æœ€é©åŒ–ã‚ªãƒ—ã‚·ãƒ§ãƒ³ã«ã¯-O3ã‚’æŒ‡å®šã—ã¾ã—ãŸã€‚ #include <iostream> #in
agw 2015/11/04
Sorting

Algorithm

Programming
ãƒªãƒ³ã‚¯
æœ¬å½“ã«å®Ÿç”¨çš„ãªãŸã£ãŸã²ã¨ã¤ã®ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ - CARTA TECH BLOG
ã‚³ãƒ³ãƒ†ãƒ³ãƒ„ãƒ¡ãƒ‡ã‚£ã‚¢äº‹æ¥æœ¬éƒ¨ã®æ–°å’ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢å‚æœ¬ãŒãŠé€ã‚Šã„ãŸã—ã¾ã™ã€‚ çªç„¶ã§ã™ãŒã€çš†ã•ã‚“ã®å¥½ããªã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ãªã‚“ã§ã™ã‹ï¼Ÿ ç§ã¯åŸºæ•°ã‚½ãƒ¼ãƒˆã®ã‚¹ãƒžãƒ¼ãƒˆã§ã‚¹ãƒˆã‚¤ãƒƒã‚¯ãªé›°å›²æ°—ã«æƒ¹ã‹ã‚Œã¾ã™ã€‚ ã¨ã¯ã„ãˆã€æ™®æ®µã®é–‹ç™ºã§ã¯ã€Œã©ã®ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ä½¿ã†ã‹ã€ã‚’æ„è˜ã™ã‚‹ã“ã¨ã¯å°‘ãªã„ã®ã§ã¯ãªã„ã§ã—ã‚‡ã†ã‹ã€‚ ã‚€ã—ã‚ç¾å®Ÿä¸–ç•Œã§ã€Œãƒˆãƒ©ãƒ³ãƒ—ãŒå…¨éƒ¨æƒã£ã¦ã‚‹ã‹ã€ã‚’æ‰‹ä½œæ¥ã§ç¢ºèªã™ã‚‹ã¨ãã¨ã‹ã®ã»ã†ãŒã€å®Ÿã¯ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒå¿…è¦ãªã®ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ã€‚ ã¨ã„ã†ã“ã¨ã§ï¼ˆï¼Ÿï¼‰ã€ãã®ã‚ˆã†ãªç¾å®Ÿçš„ãªå ´é¢ã§ã€æœ¬å½“ã«å®Ÿç”¨çš„ãªã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æ±ºã‚ã‚‹æˆ¦ã„ãŒå§‹ã¾ã‚Šã¾ã—ãŸã€‚ é¸æ‰‹ç´¹ä»‹ ä»Šå›žè©¦ã—ãŸã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ã€ç‹¬æ–ã¨åè¦‹ã§é¸ã‚“ã ä»¥ä¸‹ã®5ç¨®é¡žã€‚ 1 æŒ¿å…¥ã‚½ãƒ¼ãƒˆ ã‚·ãƒ³ãƒ—ãƒ«ãƒ»ã‚¤ã‚ºãƒ»ãƒ™ã‚¹ãƒˆï¼æ£ç›´è¨€ã£ã¦ãƒ™ãƒ³ãƒãƒžãƒ¼ã‚¯ã®å™›ã¾ã›çŠ¬ï¼ 2 ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆ ã€Œã‚¯ã‚¤ãƒƒã‚¯ã€ã®åå‰ã¯ãƒ€ãƒ†ã˜ã‚ƒãªã„ï¼çŽ‹è€…ã®è²«ç¦„ã‚’è¦‹ã›ã¦ã‚„ã‚Œï¼ 3 ãƒžãƒ¼ã‚¸ã‚½ãƒ¼ãƒˆ å®‰å®šæ„Ÿã®ã‚ã‚‹éš ã‚ŒãŸå®Ÿ
agw 2015/08/18
deferred

Sorting

Algorithm

Visualization

Programming
ãƒªãƒ³ã‚¯
ã€ã¾ãŸã‹ã‚ˆã€‘ã€ŒHaskellã§ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆã€å•é¡Œã€ä½•åº¦ç›®ã ã€‘
PinðŸ“AppBrew CTO @spinute ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆä½•è¡Œã ã¨æ€ã†ï¼Ÿ rubyãŒ40è¡Œã€c++ãŒ35è¡Œã€haskellã¯5è¡Œã ã‚ˆï¼Ÿ å¤§ãã„ã®ã¨å°ã•ã„ã®ã«ã¡ãŽã‚‹ã€ç©ºã ã£ãŸã‚‰çµ‚ã‚ã‚‹ã€ãã‚ŒãŒæœ¬è³ªã§ãã‚Œã ã‘ãŒå¿…è¦æœ€ä½Žé™ã€‚ ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆã®ã‚¤ãƒ‡ã‚¢ã¯äº”è¡Œã«åŽã¾ã‚‹ã‚‰ã—ã„ 2013-01-27 00:18:27
agw 2013/02/03
Sorting

Algorithm

Programming
ãƒªãƒ³ã‚¯
ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆæ®ºã— - d.y.d.
19:39 12/09/01 ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆæ®ºã— ã“ã†ã„ã†ç³»çµ±ã®è©±ã€‚ Quicksort Killer (kazoo04ã•ã‚“) qsortã‚’æ’ƒå¢œã—(æœ€æ‚ªã‚±ãƒ¼ã‚¹ã‚’ä¸Žãˆ)ã¦ã¿ãŸã€‚ (qnighyã•ã‚“) A Killer Adversary for Quicksort (shinhã•ã‚“ã®è§£èª¬) Webã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³ã«å¯¾ã™ã‚‹åºƒç¯„ãªDoSæ”»æ’ƒæ‰‹æ³•(hashdos)ã®å½±éŸ¿ã¨å¯¾ç– (å¾³ä¸¸ã•ã‚“ã®è§£èª¬) ãŸã ã®ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆã¯è¦ç´ æ•° N ã®é…åˆ—ã‚’ã‚½ãƒ¼ãƒˆã™ã‚‹ã®ã«æœ€æ‚ª N2 ã‚ªãƒ¼ãƒ€ã®æ™‚é–“ãŒã‹ã‹ã£ã¦ã—ã¾ã†ã€ ãã—ã¦ãã‚Œã¯ pivot ã‚’åã£ã¦é¸ã³ã¾ãã£ã¦ã—ã¾ã£ãŸæ™‚ã«ç™ºç”Ÿã™ã‚‹ã€ã¨ã„ã†ã®ã¯ã‚ˆãçŸ¥ã‚‰ã‚ŒãŸè©±ã ã¨æ€ã„ã¾ã™ã€‚ ã¨ã„ã£ã¦ã‚‚ã€åºƒãä½¿ã‚ã‚Œã¦ã„ã‚‹è¨€èªžï¼ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã®ã‚½ãƒ¼ãƒˆé–¢æ•°ã¯ãã®è¾ºã‚Šæ°—ã‚’ã¤ã‘ã‚‰ã‚Œã¦ã„ã¦ã€æœ€æ‚ªæ™‚ã‚‚ O(N log N) ã«ãªã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§å®Ÿè£…ã•ã‚Œã¦ã„ã‚‹â€¦ã¨æ€ã„è¾¼ã‚“ã§ã„ãŸã®ã§ã™ãŒï¼ˆä¾‹ãˆã° C++ ã®
agw 2012/09/03
Sorting

Algorithm

Programming
ãƒªãƒ³ã‚¯
ç¬¬12å›žã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å‹‰å¼·ä¼šã«è¡Œã£ã¦ãã¾ã—ãŸ - ã‚¢ã‚¹ãƒšæ—¥è¨˜
äººç”Ÿåˆå‹‰å¼·ä¼šã€‚ ã‚„ã£ãŸã®ã¯ counting sort ã¨ radix sortã€‚ ã“ã®äºŒã¤ã¯æ›¸ã„ãŸã“ã¨ãŒãªã‹ã£ãŸã®ã§ã€Python ã§è¶…æ‰‹æŠœãã«æ›¸ã„ã¦ã¿ãŸã€‚ https://gist.github.com/1395308 base = 10 def radix_sort(x, max): radix = 1 while radix < max: x = counting_sort(x, radix) radix *= base return x def counting_sort(a, radix): c = [0] * base for k in a: r = (k / radix) % base c[r] += 1 for i in range(1, base): c[i] += c[i - 1] b = [0] * len(a) for k in reversed(a): r =
agw 2012/08/28
deferred

Sorting

Algorithm

Programming
ãƒªãƒ³ã‚¯
ã‚·ã‚§ãƒ«ã‚½ãƒ¼ãƒˆ - Wikipedia
é–“éš”5, 3, 1ã®ã‚·ã‚§ãƒ«ã‚½ãƒ¼ãƒˆã«ãŠã‘ã‚‹è¦ç´ ã®äº¤æ›ã‚’ç¤ºã—ãŸå›³ ã‚·ã‚§ãƒ«ã‚½ãƒ¼ãƒˆï¼ˆæ”¹è‰¯æŒ¿å…¥ã‚½ãƒ¼ãƒˆã€è‹±èªž: Shellsort, Shell sort, Shell's methodï¼‰ã¯ã€1959å¹´ã«ãƒ‰ãƒŠãƒ«ãƒ‰ãƒ»ã‚·ã‚§ãƒ«ãŒé–‹ç™ºã—ãŸ[2]ã‚½ãƒ¼ãƒˆã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€‚æŒ¿å…¥ã‚½ãƒ¼ãƒˆã®ä¸€èˆ¬åŒ–[3]ã§ã‚ã‚Šã€é…åˆ—ã®ä¸ã§ã‚ã‚‹ç¨‹åº¦é–“éš”ãŒé›¢ã‚ŒãŸè¦ç´ ã®çµ„ã”ã¨ã«æŒ¿å…¥ã‚½ãƒ¼ãƒˆã‚’è¡Œã„ã€é–“éš”ã‚’å°ã•ãã—ãªãŒã‚‰åŒæ§˜ã®ã‚½ãƒ¼ãƒˆã‚’ç¹°ã‚Šè¿”ã™ã“ã¨ã§é«˜é€ŸåŒ–ã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã‚ã‚‹ã€‚ãŸã ã—ã€æŒ¿å…¥ã‚½ãƒ¼ãƒˆã¨ç•°ãªã‚Šã€å®‰å®šã‚½ãƒ¼ãƒˆã§ã¯ãªããªã‚‹ã€‚ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®åŸºæœ¬ã¯æŒ¿å…¥ã‚½ãƒ¼ãƒˆã¨åŒã˜ã§ã‚ã‚‹ã€‚æŒ¿å…¥ã‚½ãƒ¼ãƒˆã¯ã€Œã»ã¨ã‚“ã©æ•´åˆ—ã•ã‚ŒãŸãƒ‡ãƒ¼ã‚¿ã«å¯¾ã—ã¦ã¯é«˜é€Ÿã€ã¨ã„ã†é•·æ‰€ã‚’æŒã¤ãŒã€éš£æŽ¥ã—ãŸè¦ç´ åŒå£«ã—ã‹æ¯”è¼ƒãƒ»äº¤æ›ã‚’è¡Œã‚ãªã„ãŸã‚ã€ã‚ã¾ã‚Šæ•´åˆ—ã•ã‚Œã¦ã„ãªã„ãƒ‡ãƒ¼ã‚¿ã«å¯¾ã—ã¦ã¯ä½Žé€Ÿã§ã‚ã£ãŸã€‚ ã‚·ã‚§ãƒ«ã‚½ãƒ¼ãƒˆã¯ã€ã€Œé£›ã³é£›ã³ã®åˆ—ã‚’ç¹°ã‚Šè¿”ã—ã‚½ãƒ¼ãƒˆã—ã¦ã€é…åˆ—ã‚’å¤§ã¾ã‹ã«æ•´åˆ—ã•ã‚ŒãŸçŠ¶æ…‹ã«è¿‘ã¥ã‘ã¦ã„ãã€ã“ã¨ã«ã‚ˆã‚Šã€æŒ¿
agw 2010/10/28
Sorting

Algorithm

Programming
ãƒªãƒ³ã‚¯
ãƒãƒ–ãƒ«ã‚½ãƒ¼ãƒˆã®é…ã•ã‚’ä½“æ„Ÿã—ã¦ã¿ã‚‹ - yarbã®æ—¥è¨˜
ãƒãƒ–ãƒ«ã‚½ãƒ¼ãƒˆã«ã¯æ€ã„å‡ºãŒã‚ã‚‹ã€‚å¤§å¦ç”Ÿã®ã¨ãã«PC-9801ã§è½ã¡ã‚²ãƒ¼ã‚’ä½œã£ãŸã€‚ä¸Šã‹ã‚‰è½ã¡ã¦ãã‚‹ãƒˆãƒ©ãƒ³ãƒ—ã®ã‚«ãƒ¼ãƒ‰ã‚’5Ã—5ã®ãƒžãƒˆãƒªãƒƒã‚¯ã‚¹ã«ç©ã¿ä¸Šã’ã¦ã€ç¸¦æ¨ªæ–œã‚ã§ãƒãƒ¼ã‚«ãƒ¼ã®å½¹ã‚’ä½œã‚‹ã€‚ã‚„ã‚Šã“ã‚€ã¨ã€Œç¸¦åˆ—ã§æ•°å—ã‚’æƒãˆã‚ˆã†ã¨ã—ã¦ã‚‚æœ€å¾Œã§å¤±æ•—ã™ã‚‹ç¢ºçŽ‡ãŒé«˜ãã¦ã‚¹ã‚³ã‚¢ã®æœŸå¾…å€¤ã¯ä½Žã„ã€‚ã‚€ã—ã‚æ¨ªã®ãƒ•ãƒ©ãƒƒã‚·ãƒ¥ã‚’å¤šãç›®æŒ‡ã›ã€‚ãƒ•ãƒ©ãƒƒã‚·ãƒ¥ä½œã‚Šã¯ä¸€æ°—ã«ã‚„ã‚‰ãªã„ã¨å¤±æ•—ã®ãƒšãƒŠãƒ«ãƒ†ã‚£ãŒé«˜ã™ãŽã‚‹ã€ã¨ã„ã†ã‚ˆã†ãªçµŒé¨“å‰‡ãŒè“„ç©ã—ã¦ã„ãæ¥½ã—ã„ã‚²ãƒ¼ãƒ ã ã£ãŸã€‚ã„ã¾ã§ã‚‚ã‚„ã‚ŠãŸã„ãã‚‰ã„ã€‚ãŸã¶ã‚“ã‚ªãƒªã‚¸ãƒŠãƒ«ã¯ã€Œç‰çƒã€ã¨ã„ã†åå‰ã®ã‚¢ãƒ¼ã‚±ãƒ¼ãƒ‰ã‚²ãƒ¼ãƒ ã ã£ãŸã€‚ ãã®ã¨ãã€ãƒãƒ¼ã‚«ãƒ¼ã®å½¹åˆ¤å®šã®ãƒã‚¸ãƒƒã‚¯ã‚’æ›¸ãä¸‹ã‚ã—ãŸã¨ãã«ã‚„ã£ãŸã®ãŒã€ãƒãƒ–ãƒ«ã‚½ãƒ¼ãƒˆã ã¨ã„ã†ã“ã¨ã‚’ã€ã‹ãªã‚Šå¾Œã«ãªã£ã¦ã‹ã‚‰çŸ¥ã£ãŸã€‚å½“æ™‚ã¯ã‚½ãƒ¼ãƒˆã¨ã„ã†è¨€è‘‰ã™ã‚‰çŸ¥ã‚‰ãªã‹ã£ãŸã€‚ ã‚«ãƒ¼ãƒ‰ã¯æœ€å¤§ã§5æžšã ã—ã€ãƒã‚§ãƒƒã‚¯ã™ã¹ãåˆ—ã‚‚1åº¦ã«æœ€å¤§4åˆ—ã ã‹ã‚‰ã€ã©ã‚“ãªã«ã²ã©ã„ã“ã¨ã‚’ã‚„ã£ã¦ã‚‚å‡¦ç†æ™‚é–“ã¯ã‹ã‹ã‚‰ãªã„ã¨ã„ã†ã“ã¨ã¯åˆ†ã‹ã£ã¦ã„ãŸ
agw 2010/10/28
Sorting

Algorithm

Programming
ãƒªãƒ³ã‚¯
é€£çµãƒªã‚¹ãƒˆã®ã‚½ãƒ¼ãƒˆ - yarbã®æ—¥è¨˜
Cå…¥é–€ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°å…¥é–€ã¨ã—ã¦ã€é€£çµãƒªã‚¹ãƒˆã®æ¬¡ã«åŸºæœ¬çš„ãªã‚½ãƒ¼ãƒˆã‚’ã‚„ã£ã¦ã¿ã‚ˆã†ã¨å°‘ã—æ ¼é—˜ã—ã¦ã¿ãŸã€‚å˜ç´”ãªinté…åˆ—ã¨ã‹ã˜ã‚ƒãƒ†ã‚ã‚¹ãƒˆã®ã¾ã¾ãªã®ã§ã€ã©ã†ã›ã ã£ãŸã‚‰é€£çµãƒªã‚¹ãƒˆã‚’ä¸¦ã¹å¤‰ãˆã¦ã¿ã‚ˆã†ã¨æ€ã£ãŸã®ãŒé–“é•ã„ã ã£ãŸã€‚ ã¾ãšã€ã„ã¡ã°ã‚“ç°¡å˜ãªã®ã¯éš£ã‚Šåˆã†ãƒŽãƒ¼ãƒ‰ã‚’å…¥ã‚Œæ›¿ãˆã‚‹swapé–¢æ•°ã‚’ä½œã‚‹ã“ã¨ã‹ã¨æ€ã£ãŸã€‚ã‚ã‚‹ä¸–ä»£ä»¥é™ã®Cã§ã¯æ§‹é€ ä½“åŒå£«ã®ä»£å…¥ãŒã§ãã‚‹ã‚‰ã—ã„ã®ã§ã€ã‚‚ã—ã‹ã—ã¦ãƒã‚¤ãƒ³ã‚¿å…¥ã‚Œæ›¿ãˆã‚ˆã‚Šã‚‚ã€ã”ãã£ã¨ãƒ‡ãƒ¼ã‚¿ã‚’å…¥ã‚Œæ›¿ãˆã‚‹ã®ãŒæ£è§£ãªã®ã‹ã¨ä¸€çž¬æ€ã£ãŸã‘ã©ã€ã•ã™ãŒã«ãã‚Œã˜ã‚ƒãƒªã‚¹ãƒˆã®æ„å‘³ãŒãªã„ã€‚ ã¨ã‚‚ã‚ã‚Œã€swapé–¢æ•°ã•ãˆã‚ã‚Œã°ã€å¾Œã¯ãƒªã‚¹ãƒˆã‚’é †ã«ãŸãã‚Šã¤ã¤å…¥ã‚Œæ›¿ãˆã‚Œã°ãƒãƒ–ãƒ«ã‚½ãƒ¼ãƒˆã¯ã™ãã§ãã‚‹ã¯ãšã€‚ã§ã‚‚ã€è€ƒãˆã¦ã¿ã‚‹ã¨ã€2å€‹ã®ãƒŽãƒ¼ãƒ‰ã‚’å…¥ã‚Œæ›¿ãˆã‚‹ã¨ã„ã£ã¦ã‚‚ãã‚Œã‚‰ãŒéš£æŽ¥ã™ã‚‹ãƒŽãƒ¼ãƒ‰ã¨ã®é…ç·šã‚‚ã‚ã‚‹ã®ã§ã€ã©ã†ã‚‚å˜ç´”ã˜ã‚ƒãªã„ã€‚ã—ã‹ã‚‚ã€å…ˆé ã¯list->headã¨ç‰¹æ®Šãªãƒã‚¤ãƒ³ã‚¿ã§å‚ç…§ã•ã‚Œã¦ã„ãŸã‚Šã€æœ€å¾Œã¯NULLã§çµ‚ã‚ã£ã¦ã„ãŸ
agw 2010/10/28
Sorting

Algorithm

Programming
ãƒªãƒ³ã‚¯
ãƒžãƒ«ãƒã‚ãƒ¼ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆ - sileã®ãƒ–ãƒã‚°
ã€ŒSorting and Searching Stringsã€ã§èª¬æ˜Žã•ã‚Œã¦ã„ã‚‹ãƒžãƒ«ãƒã‚ãƒ¼ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆã®å®Ÿè£…ã€‚ è©³ç´°ã¯ãƒªãƒ³ã‚¯å…ˆã‚’å‚ç…§ã€‚ ãƒžãƒ«ãƒã‚ãƒ¼ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆ æ–‡å—åˆ—ã®é…åˆ—ã®ã‚½ãƒ¼ãƒˆãŒé«˜é€Ÿã«è¡Œãˆã‚‹ URL("http://...")ã®é…åˆ—ã®ã‚ˆã†ãªæŽ¥é éƒ¨åˆ†ã®é‡è¤‡çŽ‡ãŒé«˜ã„æ–‡å—åˆ—é…åˆ—ã®å ´åˆã§ã‚‚æ€§èƒ½ãŒä½Žä¸‹ã—ã«ãã„ ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆ + åŸºæ•°ã‚½ãƒ¼ãƒˆã€ã®ã‚ˆã†ãªæ„Ÿã˜ï¼Ÿ ã‚½ãƒ¼ãƒˆæ–¹æ³• åŸºæœ¬çš„ã«ã¯é€šå¸¸ã®ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆã¨ä¼¼ã¦ã„ã¦ã€Œãƒ”ãƒœãƒƒãƒˆè¦ç´ *1ã‚’é¸ã‚“ã§ã€é…åˆ—ã‚’åˆ†å‰²ã™ã‚‹ã€ã¨ã„ã£ãŸã“ã¨ã‚’ç¹°ã‚Šè¿”ã™ã€‚ ãŸã ã—ã€ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆã¯å„æ®µéšŽã§é…åˆ—ã‚’äºŒåˆ†å‰²(ãƒ”ãƒœãƒƒãƒˆè¦ç´ ã‚ˆã‚Šã‚‚å¤§ãã„ã‹å°ã•ã„ã‹*2 )ã—ã€ãã®ãŸã‚ã®æ¯”è¼ƒã«ã¯è¦ç´ (æ–‡å—åˆ—)å…¨ä½“ã‚’ç”¨ã„ã‚‹ã®ã«å¯¾ã—ã¦ã€ãƒžãƒ«ãƒã‚ãƒ¼ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆã§ã¯ã€é…åˆ—ã¯ä¸‰åˆ†å‰²(ãƒ”ãƒœãƒƒãƒˆè¦ç´ ã‚ˆã‚Šã‚‚å¤§ãã„ã‹å°ã•ã„ã‹ã€ãã‚Œã¨ã‚‚ç‰ã—ã„ã‹)ã•ã‚Œã€ãã®ãŸã‚ã®æ¯”è¼ƒã«ã¯æ–‡å—åˆ—å…¨ä½“ã§ã¯ãªã(å„æ®µéšŽã§)ä¸€æ–‡å—ã®ã¿ã€ãŒç”¨ã„ã‚‰ã‚Œ
agw 2010/10/28
Sorting

Algorithm

Programming
ãƒªãƒ³ã‚¯
Robert Sedgewick - Robert Sedgewick
Robert Sedgewick is the founding chair and the William O. Baker Professor in the Department of Computer Science at Princeton University. He was a member of the board of directors of Adobe Systems from 1990 to 2016, served on the faculty at Brown University from 1975 to 1985, and has held visiting research positions at Xerox PARC, IDA, and INRIA. His research expertise is in algorithm science, data
agw 2010/10/28
Sorting

Algorithm

Programming
ãƒªãƒ³ã‚¯
1