[B! ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ] yshlã®ãƒ

yshl id:yshl

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«é–¢ã™ã‚‹yshlã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (16)

${{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}}

è‡ªå‹•å¾®åˆ† â‰ªãƒ•ã‚©ãƒ¯ãƒ¼ãƒ‰ãƒ»ãƒ¢ãƒ¼ãƒ‰â‰« - d.y.d.
23:21 11/12/22 ä»Šå¹´èªã‚“ã é¢ç™½ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã‚µã‚¤ã‚¨ãƒ³ã‚¹è«–æ–‡ç´¹ä»‹ã‚«ãƒ¬ãƒ³ãƒ€ãƒ¼ ç¬¬ n (1<n) é€±ç›®ãƒ¢ãƒ¼ãƒ‰ã§ã™ã€‚ â˜† ã€Œé›£ã—ã„å•é¡Œã€ â˜† ã€Œåã®ãªã„é–¢æ•°ã€ â˜† ã€Œæ¼”ç®—ã®ã›ã„ã—ã¤ã€ ã€Œé›£ã—ã„å•é¡Œã€ [5] R. Impagliazzo and L. A. Levin. "No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random." FOCS 1990. ãƒ©ãƒ³ãƒ€ãƒ ç”Ÿæˆã«èˆˆå‘³ãŒã‚ã‚Šã¾ã™ã€‚ ãƒ‘ã‚ºãƒ«ã‚²ãƒ¼ãƒ ã‚’ä½œã‚Šã¾ã—ãŸã€‚ ã•ã¦ã€æ‰‹å¼·ã„é›£æ˜“åº¦ã®é¢ãƒ‡ãƒ¼ã‚¿ã‚’ç„¡é™ã«ãƒ©ãƒ³ãƒ€ãƒ ç”Ÿæˆã™ã‚‹ã«ã¯ã©ã†ã™ã‚Œã°ã„ã„ã ã‚ã†ã€‚ ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚³ãƒ³ãƒ†ã‚¹ãƒˆã®å•é¡Œã‚’ä½œã‚Šã¾ã—ãŸã€‚ ã•ã¦ã€è‡ªå‹•ãƒã‚§ãƒƒã‚¯ç”¨ã®ãƒ†ã‚¹ãƒˆãƒ‡ãƒ¼ã‚¿ã‚’ãƒ©ãƒ³ãƒ€ãƒ ç”Ÿæˆã™ã‚‹ã«ã¯ã©ã†ã™ã‚Œã°ã„ã„ã ã‚ã†ã€‚ é©å½“ãªãƒ©ãƒ³ãƒ€ãƒ ç”Ÿæˆã§ã¯ã€ç°¡å˜ãªã‚±ãƒ¼ã‚¹ã°ã£ã‹ã‚Šä½œã‚‰ã‚Œã¦ã—ã¾ã„ å˜˜è§£æ³• ã«çª
yshl 2011/12/03
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
4chan BBS - Genius sorting algorithm: Sleep sort
1 Name: Anonymous : 2011-01-20 12:22 Man, am I a genius. Check out this sorting algorithm I just invented. #!/bin/bash function f() { sleep "$1" echo "$1" } while [ -n "$1" ] do f "$1" & shift done wait example usage: ./sleepsort.bash 5 3 6 3 6 3 1 4 7 2 Name: Anonymous : 2011-01-20 12:27 >>1 Oh god, it works. But I don't like to wait 218382 seconds to sort '(0 218382)
yshl 2011/05/19
ãã®å®Ÿè£…ã€ sort 2 1 1 1 1 ... (10å„„å€‹ã®1) ... 1 1 ã¯æ£ã—ãã‚½ãƒ¼ãƒˆã§ãã¾ã™ã‹ã€‚

ãƒã‚¿

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
å††å‘¨çŽ‡ã®å…¬å¼ã¨è¨ˆç®—æ³•(PDF)
yshl 2010/09/09
æ•°å¦

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
CORDIC
10/02/24 é–¢æ•°é›»å“ã®ã—ãã¿(CORDICã‚¢ãƒ«ã‚´ãƒ«ã‚ºãƒ ) ã¾ãŸã¾ãŸã€Œç†ç³»äººã®ãŸã‚ã®é–¢æ•°é›»å“ãƒ‘ãƒ¼ãƒ•ã‚§ã‚¯ãƒˆã‚¬ã‚¤ãƒ‰ã€ã®è©±é¡Œï¼Žå…ˆæ—¥ï¼Œèªè€…ã®æ–¹ã‹ã‚‰ãƒ¡ãƒ¼ãƒ«ã‚’é ‚ã„ãŸï¼Žå†…å®¹ã‚’æŠœç²‹ã™ã‚‹ã¨ï¼Œ P.244-245ã€€CORDICã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®é … å›³C-8ã€€CORDICã®å›³è§£ ã€Œå›³C-8ã®è¦é ˜ã§ä¸‰å¹³æ–¹ã®å®šç†ã‚’ä½¿ãˆã°æŽ›ã‘ç®—ã¨è¶³ã—ç®—ã®çµ„ã¿åˆã‚ã›ã ã‘ã§xã¨yãŒæ±‚ã¾ã‚Šã¾ã™ã€ã¨è¨˜ã•ã‚Œã¦ã„ã¾ã™ï¼Ž ã—ã‹ã—ç§ã¯ã“ã®å›³C-8ã‚’ç©´ã®é–‹ãã»ã©è¦‹ã¤ã‚ã¦ã‚‚xã¨yã‚’æ±‚ã‚ã‚‹æ–¹æ³•ãŒè§£ã‚Šã¾ã›ã‚“ï¼Ž ã©ã“ã‹ã«è£œåŠ©ç·šã‚’å¼•ãã¨é–ƒãã®ã‹ã¨æ€ã„ï¼Œå›³ã‚’æ¨ªã‹ã‚‰è¦‹ãŸã‚Šï¼Œé€†ã•ã¾ã‹ã‚‰è¦‹ãŸã‚Šã¨ ä½•åº¦ã‚‚è¦‹ç›´ã—ã¾ã—ãŸãŒé–ƒãã¾ã›ã‚“ï¼Ž ä½•ã‹ã¨ã‚“ã§ã‚‚ãªã„å‹˜é•ã„ã‚’ã—ã¦ã„ã‚‹ã‚ˆã†ãªæ°—ã‚‚ã—ã¦ã„ã¾ã™ï¼Ž ã‚‚ã—å®œã—ã‘ã‚Œã°æ•™ãˆã¦é ‚ã‘ãªã„ã§ã—ã‚‡ã†ã‹ï¼Ž ã¨ã®ã“ã¨ï¼Žå®Ÿã¯ï¼Œã“ã®ãƒšãƒ¼ã‚¸ã‚’æ›¸ã„ã¦ã„ã‚‹ã¨ãã¯CORDICã®ã‚ã‹ã‚Šã‚„ã™ã„èª¬æ˜ŽãŒæ€ã„ã¤ã‹ãªã‹ã£ãŸã“ã¨ã¨ï¼Œã‚³ãƒ©ãƒ ã¨ã„ã†é™ã‚‰ã‚ŒãŸã‚¹ãƒšãƒ¼ã‚¹ã§
yshl 2010/06/13
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
ã“ã¤ã“ã¤ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ (Spigot Algorithm)
æ¦‚è¦ å††å‘¨çŽ‡ã®å€¤ã‚’è¨ˆç®—ã™ã‚‹ãŸã‚ã«ã¯ã€å¤šå€é•·è¨ˆç®—ã‚’ã—ãªã‘ã‚Œã°ãªã‚‰ãªã„ã¨æ€ã‚ã‚Œã¦ã„ã¾ã—ãŸã€‚ã¨ã“ã‚ãŒã€ã“ã¤ã“ã¤ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ç”¨ã„ã‚‹ã¨ã€ç‰¹åˆ¥ã«å¤šå€é•·è¨ˆç®—ã‚’ã—ãªãã¦ã‚‚ã‚ˆã„ã“ã¨ãŒç¤ºã•ã‚Œã¾ã—ãŸã€‚ æœ€åˆã«ã€ã“ã¤ã“ã¤ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®æ¦‚è¦ã«ã¤ã„ã¦ç¤ºã—ã¾ã™ã€‚ã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã¯ã€æ¬¡ã®ç´šæ•°ã‚’åŸºã«ã—ã¦è¨ˆç®—ã—ã¾ã™ã€‚ ã“ã“ã§ã€divã‚’æ•´æ•°å•†ã€modã‚’å‰°ä½™ã¨ã—ã¾ã™ã¨ã€(ä¾‹ãˆã°ã€ã¨ãªã‚Šã¾ã™) ãŒæˆã‚Šç«‹ã¡ã¾ã™ã€‚ã“ã¤ã“ã¤ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã“ã®é–¢ä¿‚ã‚’ã©ã†ç”¨ã„ã‚‹ã‹ã€æœ€åˆã«ãƒã‚¤ãƒ”ã‚¢æ•°ã‚’ä¾‹ã«ã€ç¤ºã™ã“ã¨ã«ã—ã¾ã™ã€‚ã¾ãšã€å°æ•°ç‚¹ä»¥ä¸‹1æ¡ç›®ã®1ã‚’æŠ½å‡ºã—ã¾ã™ã€‚å¼ä¸ã®é’è‰²ã®éƒ¨åˆ†ã«ã”æ³¨ç›®ãã ã•ã„ã€‚ ã“ã‚Œã§ã€7ãŒæŠ½å‡ºã§ãã¾ã—ãŸã€‚å¼•ãç¶šãã€å°æ•°ç‚¹ä»¥ä¸‹2æ¡ç›®ã®1ã‚’æŠ½å‡ºã—ã¦ã¿ã¾ã™ã€‚ ã“ã®æ‰‹ç¶šãã‚’ç¹°ã‚Šè¿”ã™ã“ã¨ã«ã‚ˆã‚Šã€å¤šå€é•·è¨ˆç®—ã‚’ã›ãšã«å°æ•°ç‚¹ä»¥ä¸‹ã®æ•°ã‚’æ±‚ã‚ã‚‹ã“ã¨ãŒã§ãã‚‹ã‚ã‘ã§ã™ã€‚å®Ÿéš›ã«ã¯ã€ç¹°ã‚Šä¸ŠãŒã‚Šã®å‡¦ç†ç‰ã‚’ã—ãªã‘ã‚Œã°ãªã‚Šã¾ã›ã‚“ãŒã€æœ¬è³ªã¯ã“ã“ã§è¿°ã¹ãŸè¨ˆç®—ã«ã‚ã‚Šã¾ã™ã€‚
yshl 2010/04/17
ã‚´ãƒ«ãƒ•å‘ã

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
å¤©æ³£è¨˜
2009-09-01 (Tue)#1é‚£é ˆ 2009-09-02 (Wed)#1é‚£é ˆ 2009-09-03 (Thu)#1ã‚ãƒ£ãƒƒã‚·ãƒ¥ã®ã‚·ãƒŸãƒ¥ãƒ¬ãƒ¼ã‚·ãƒ§ãƒ³ã« priority queue ãŒä½¿ãˆã‚‹ã‹è€ƒãˆã¦ã¿ã‚‹ã€‚ ... ä½¿ãˆãªã„ã‹ã€‚ Cell ã‚’å…ˆé ã«ã‚‚ã£ã¦ãã‚‹ã¨ãã«ã€ã‚‚ã¨ã‚ã£ãŸå ´æ‰€ã‚’è¨˜éŒ²ã™ã‚‹å¿…è¦ãŒã‚ã‚‹ãŒã€ãã®å ´æ‰€ã‚’æ±‚ã‚ã‚‹ã®ãŒå®¹æ˜“ã§ãªã„ã€‚ 2009-09-04 (Fri)#1äºŒåˆ†æœ¨ã®æ§‹é€ ã‚’ã‚¤ãƒ¡ãƒ¼ã‚¸ã™ã‚‹ã¨ãã€ bintree1.asy: size(100mm,100mm); void bintree(pair p, int n) { fill(shift(p)*unitcircle); if (n != 0) { pair p1 = shift(-(2**n),-2) * p; pair p2 = shift(+(2**n),-2) * p; draw(p--p1); draw(p--p2); b
yshl 2009/09/19
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
lucky sort
(algorithm) Definition: The best possible sort algorithm: it is so lucky that the input is already sorted, and it need do nothing! See also bogosort, bozo sort, stooge sort. Note: Defined more for humorous, rather than serious, purposes. Time complexity is Î˜(0) (zero): it takes no time. Author: PEB Go to the Dictionary of Algorithms and Data Structures home page. If you have suggestions, correctio
yshl 2008/08/20
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
Stooge sort - Wikipedia
Stooge sort is a recursive sorting algorithm. It is notable for its exceptionally bad time complexity of = The running time of the algorithm is thus slower compared to reasonable sorting algorithms, and is slower than bubble sort, a canonical example of a fairly inefficient sort. It is however more efficient than Slowsort. The name comes from The Three Stooges.[1] The algorithm is defined as follo
yshl 2008/08/20
n^2.7ã£ã¦ãƒãƒ–ãƒ«ã‚½ãƒ¼ãƒˆã‚ˆã‚Šé…ã„ã˜ã‚ƒãªã„ã‹

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
"ç™¾ç§‘äº‹å…¸æ£’" ç®—è¡“ç¬¦å· - Google æ¤œç´¢
ç™¾ç§‘äº‹å…¸æ£’ã€åŽŸæ¥å¦‚æ¤ã€ç®—æœ¯ç¼–ç Â· dingding @ 2022.02.18 , 03:31 ä¸Šåˆ ... æ¯ä¸€ä¸ªå—ç”¨ä¸¤ä½æ•°è¡¨ç¤ºï¼ŒA ä¸º01ï¼ŒBä¸º02ï¼Œ00ä¸ºç©ºç™½ï¼Œæ ‡ç‚¹ç¬¦å·ä¹ŸåŒæ ·æ•°å—åŒ–ã€‚
yshl 2008/07/06
2ä»¶

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
2003å¹´07æœˆ09æ—¥ãƒ»æ¦‚å¿µã€Œç™¾ç§‘äº‹å…¸ã‚’æ£’ã«åˆ»ã‚€ã€ãƒ»77ç‚¹
yshl 2008/07/06
ã€Œå•é¡Œã¯ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã«ã‚ã‚‹ã®ã§ã™ã€ã£ã¦ç‰¹è¨±ã§ç®—è¡“ç¬¦å·åŒ–ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒè‡ªç”±ã«ä½¿ãˆãªã„ã“ã¨?

æœ¬

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
Gnome sort - Wikipedia
Gnome sort (nicknamed stupid sort) is a variation of the insertion sort sorting algorithm that does not use nested loops. Gnome sort was originally proposed by Iranian computer scientist Hamid Sarbazi-Azad (professor of Computer Science and Engineering at Sharif University of Techno logy)[1] in 2000. The sort was first called stupid sort[2] (not to be confused with bogosort), and then later describ
yshl 2008/03/08
ã‚´ãƒ«ãƒ•å‘ã?

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
2006-06-17
åˆ†å²ã—ãªã„4è¦ç´ ã®ã‚½ãƒ¼ãƒˆã€GCC/Linux/x86,x86_64,armç‰ˆ ã“ã¡ã‚‰ã«ã€ã€Œåˆ†å²ã—ãªã„ã‚½ãƒ¼ãƒˆã€ã¨ã„ã†è¨˜äº‹ãŒã‚ã‚Šã¾ã™ã€‚çŸã„ã®ã§èªã‚“ã§ã„ãŸã ãã»ã†ãŒã‚ˆã„ã¨æ€ã„ã¾ã™ãŒã€æ–‡ç« ï¼†ã‚¢ã‚»ãƒ³ãƒ–ãƒªè¨€èªžã®ã‚³ãƒ¼ãƒ‰ã®å†…å®¹ã‚’è¦ç´„ã™ã‚‹ã¨ã€ 4è¦ç´ ã®ã‚½ãƒ¼ãƒˆã¯ã€é ‘å¼µã‚Œã°5å›žã®æ¯”è¼ƒã¨5å›žã®äº¤æ›ã§ã§ãã‚‹ã‚ˆã€‚ã•ã‚‰ã«ã€äº¤æ›ã‚’ Pentium Pro ã§è¿½åŠ ã•ã‚ŒãŸå‘½ä»¤ã§ã‚ã‚‹CMOVcc(Conditional Move)ã§è¡Œã†ã“ã¨ã«ã™ã‚Œã°ã€ã€Œcmp b, a ã—ã¦ã€ b < a ã®ã¨ãã ã‘ b ã¨ a ã‚’swapã€ã¨ã„ã†å‡¦ç†ã‚’åˆ†å²å‘½ä»¤ãªã—ã§è¡Œã†ã“ã¨ãŒã§ãã‚‹ã‹ã‚‰é€Ÿã„ã‚ˆã€‚ ã¨ãªã‚Šã¾ã™ã€‚ã“ã®ã€ã€Œ4è¦ç´ å°‚ç”¨ãƒ»VC++å°‚ç”¨ã®åˆ†å²ã—ãªã„ã‚½ãƒ¼ãƒˆã€ã‚’ã€ã„ã¤ã‚‚ã®ã‚ˆã†ã«(?) GCCå‘ã‘ã«æ›¸ãç›´ã—ã¦ã¿ã¾ã—ãŸã€‚ã“ã¡ã‚‰ã€‚ åˆ†å²ã—ãªã„Nè¦ç´ ã® odd-even mergesortã€GCC/Linux/x86_64ç‰ˆ (x86_64ã®ãŠå‹‰å¼·ãŒã¦
yshl 2007/12/21
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
https://katsu.watanabe.name/ancientfj/article.php?mid=%3C8l1mc5%24rv%241%40nw042.infoweb.ne.jp%3E
yshl 2007/12/21
ã“ã®ãƒã‚¤ãƒˆãƒ‹ãƒƒã‚¯ã‚½ãƒ¼ãƒˆãŒ http://www.ipc.yamanashi.ac.jp/bul/final99/contents/ishihara/R0207/bitonic/bitonic-instance.html ã¨åŒã˜ãªã®ã‹ã‚ˆãåˆ†ã‹ã‚‰ãªã„ / via http://www.emit.jp/prog/prog_s.html

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
PSC'99(Parallel Software Contest'99)å ±å‘Šã€œè£½ä½œã—ãŸãƒ—ãƒã‚°ãƒ©ãƒ ã«ã¤ã„ã¦ã€œ
ä»Šå›žã€1999å¹´4æœˆã‹ã‚‰5æœˆã«ã‹ã‘ã¦JSPP'99ï¼ˆã‚·ãƒ³ãƒã‚¸ã‚¦ãƒ ï¼‰ã®ä¸ã§ä½µè¨ã•ã‚ŒãŸPSC'99ï¼ˆä¸¦åˆ—ã‚½ãƒ•ãƒˆã‚¦ã‚¨ã‚¢ã‚³ãƒ³ãƒ†ã‚¹ãƒˆï¼‰ã®NEC_Cenju-4éƒ¨é–€ã§2ä½ã«å…¥è³žã—ãŸã€‚å±±æ¢¨å¤§å¦ã®å¦ç”Ÿã§ã¯å½“ã‚³ãƒ³ãƒ†ã‚¹ãƒˆã§å…¥è³žã™ã‚‹ã®ã¯ç§ãŒå§‹ã‚ã¦ã§ã‚ã‚‹ã€‚ãã“ã§å½“ã‚³ãƒ³ãƒ†ã‚¹ãƒˆã¨ã¯ã©ã®ã‚ˆã†ãªã‚‚ã®ã‹ã¨ã„ã†ã®ã¨ã€ä¸¦åˆ—è¨ˆç®—æ©Ÿã®æœ‰ç”¨æ€§ã‚’èª¬æ˜Žã—ãŸå¾Œã§ã€ã‚³ãƒ³ãƒ†ã‚¹ãƒˆã§å‡ºé¡Œã•ã‚ŒãŸå•é¡Œã¨ãã®å•é¡Œã«å¯¾ã™ã‚‹ç§ã®é–‹ç™ºã—ãŸãƒ—ãƒã‚°ãƒ©ãƒ ã®åŸºæœ¬ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æç¤ºã—ç°¡å˜ã«è§£èª¬ã™ã‚‹ã€‚ ä»Šå›žã®ã‚½ãƒ•ãƒˆã‚¦ã‚¨ã‚¢ã‚³ãƒ³ãƒ†ã‚¹ãƒˆ(PSC'99)ã¯JSPP'99(Joint Symposium on Parallel Processing)ã®ä¸ã§ä½µè¨ã•ã‚Œã¦ã„ã‚‹ä¸¦åˆ—ã‚½ãƒ•ãƒˆã‚¦ã‚¨ã‚¢ã®ã‚³ãƒ³ãƒ†ã‚¹ãƒˆã§ã€å„ä¼æ¥ã‹ã‚‰æä¾›ã•ã‚Œã‚‹ä¸¦åˆ—ãƒžã‚·ãƒ³ã‚’ä½¿ã£ã¦å•é¡Œã‚’è§£æ±ºã™ã‚‹ã€‚ ã¡ãªã¿ã«ä»Šå›žã¯ä»¥ä¸‹ã®ãƒžã‚·ãƒ³ãŒä½¿ç”¨å¯èƒ½ã§ã‚ã£ãŸã€‚ Cenju-4(NEC) SR2201(æ—¥ç«‹) AP3000(å¯Œå£«é€š) E
yshl 2007/12/21
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
"ãƒã‚¤ãƒˆãƒ‹ãƒƒã‚¯ã‚½ãƒ¼ãƒˆ" - Google æ¤œç´¢
ãƒã‚¤ãƒˆãƒ‹ãƒƒã‚¯ãƒžãƒ¼ã‚¸ã‚½ãƒ¼ãƒˆï¼ˆè‹±èªž: Bitonic mergesortï¼‰ã¾ãŸã¯å˜ã«ãƒã‚¤ãƒˆãƒ‹ãƒƒã‚¯ã‚½ãƒ¼ãƒˆï¼ˆè‹±èªž: Bitonic sortï¼‰ã¨ã¯ã€ã‚½ãƒ¼ãƒˆã®ä¸¦åˆ—ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®1ã¤ã€‚
yshl 2007/12/21
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
livedoor Developers Blog:String::Trigram ã§ãƒ†ã‚ã‚¹ãƒˆã®é¡žä¼¼åº¦ã‚’æ¸¬ã‚‹ - livedoor Blogï¼ˆãƒ–ãƒã‚°ï¼‰
ã“ã‚“ã«ã¡ã¯ã€‚æ¤œç´¢ã‚°ãƒ«ãƒ¼ãƒ—è§£æžãƒãƒ¼ãƒ ã® nabokov7 ã§ã™ã€‚ ä»Šå›žã¯ã€livedoor ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã§ã®äº‹ä¾‹ã‚ˆã‚Šã€ãƒ†ã‚ã‚¹ãƒˆã®é¡žä¼¼åº¦ã‚’æ¸¬ã‚‹ã®ã«ä¾¿åˆ©ãªæ‰‹æ³•ã‚’ç´¹ä»‹ã—ã¾ã™ã€‚ livedoor ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã¯ã€livedoor ãƒ–ãƒã‚°ã§ãã®æ—¥ãã®æ—¥ã§è©±é¡Œã«ãªã£ãŸèªžã‚’ãƒ©ãƒ³ã‚ãƒ³ã‚°è¡¨ç¤ºã™ã‚‹ã‚µãƒ¼ãƒ“ã‚¹ã§ã™ã€‚ å½“åˆã€ã¯ã¦ãªã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚„Wikipediaã‚’è¶³ã—ã¦2ã§å‰²ã£ãŸã‚ˆã†ãªã‚µãƒ¼ãƒ“ã‚¹ã‚’ä½œã‚Œã¨ã„ã£ãŸé–‹ãç›´ã£ãŸæŒ‡ç¤ºã®ã‚‚ã¨ã§é–‹ç™ºãŒé–‹å§‹ã•ã‚ŒãŸã¨ã‚‚ã„ã†ã€åˆ†ç¤¾åŒ–å‰ã®èŠ¸é¢¨ã®åæ®‹ã§ã€ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã®æ¤œç´¢çµæžœã«ã¯ãƒ¦ãƒ¼ã‚¶ãŒè‡ªç”±ã«è§£èª¬ã‚’æ›¸ãè¾¼ã‚ã‚‹ Wikipedia çš„ã‚¹ãƒšãƒ¼ã‚¹ã‚‚ã¤ã„ã¦ã„ã¾ã™ã€‚ ã§ã€ã“ã®è§£èª¬éƒ¨åˆ†ã«ã€ã•ã¾ã–ã¾ãªã‚µã‚¤ãƒˆã‹ã‚‰æ–‡ç« ã‚’ã¾ã‚‹å†™ã—ã—ã¡ã‚ƒã†äººãŒã¨ã¦ã‚‚å¤šã„ã®ã§ã™ãã€‚ ç‰¹ã«å¤šã„ã‚¦ã‚£ã‚ãƒšãƒ‡ã‚£ã‚¢æ—¥æœ¬èªžç‰ˆã‹ã‚‰ã®å‰½çªƒã‚’é˜²æ¢ã™ã‚‹ãŸã‚ã«ã€livedoor ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã§ã¯ä»¥ä¸‹ã®ã‚ˆã†ãªå¯¾ç–ã‚’è¬›ã˜ã‚‹ã“ã¨ã«ã—ã¾ã—ãŸã€‚ ã‚¦ã‚£ã‚ãƒšãƒ‡ã‚£ã‚¢æ—¥æœ¬èªžç‰ˆã®è§£èª¬
yshl 2007/10/17
éŸ³æ¥½ã‚„çµµç”»ã ã¨ã©ã†ãªã‚‹ã ã‚ã†ã€‚

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
1