[B! algorithm] masterqã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

masterq id:masterq

algorithmã«é–¢ã™ã‚‹masterqã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (50)

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

X ã®ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ‰ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®å®Ÿè£…ã‚’èªã‚€
ã¯ã˜ã‚ã« 2026å¹´1æœˆã€X ã®ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ‰ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒå…¬é–‹ã•ã‚Œã¾ã—ãŸã€‚ ä»¥å‰ã«ã‚‚ã€ï¼ˆTwitter ã¨å‘¼ã°ã‚Œã¦ã„ãŸé ƒã®ï¼‰ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ‰ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ [1]ãŒå…¬é–‹ã•ã‚Œã¦ã„ã¾ã—ãŸãŒã€ä»Šå›žã¯ç¾æ™‚ç‚¹ã§ã®æœ€æ–°ç‰ˆã®ãƒã‚¸ãƒƒã‚¯ã¨ãªã£ã¦ã„ã¾ã™ã€‚ ã“ã®è¨˜äº‹ã§ã¯ã€å…¬é–‹ã•ã‚ŒãŸã‚³ãƒ¼ãƒ‰ã‚’èªã‚“ã§ä»¥ä¸‹ã®ç‚¹ã«ã¤ã„ã¦ç†è§£ã‚’æ·±ã‚ã‚ˆã†ã¨æ€ã„ã¾ã™ã€‚ X ã®ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ‰ã‚·ã‚¹ãƒ†ãƒ å…¨ä½“ã®ã‚¢ãƒ¼ã‚ãƒ†ã‚¯ãƒãƒ£ å€™è£œç”Ÿæˆã¨ãƒ©ãƒ³ã‚ãƒ³ã‚°ã®2æ®µéšŽæ§‹æˆã®å®Ÿè£… Two-Tower ãƒ¢ãƒ‡ãƒ«ã«ã‚ˆã‚‹é«˜é€Ÿãªå€™è£œæ¤œç´¢ã®ä»•çµ„ã¿ Grok-based Transf ormer ã‚’ç”¨ã„ãŸãƒ©ãƒ³ã‚ãƒ³ã‚°ãƒ¢ãƒ‡ãƒ«ã®è©³ç´° ãƒªã‚¢ãƒ«ã‚¿ã‚¤ãƒ æŽ¨è«–ã‚’å®Ÿç¾ã™ã‚‹ãŸã‚ã®å·¥å¤« æ¦‚è¦³ 2-stage ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ‰ã‚·ã‚¹ãƒ†ãƒ ã®æ§‹æˆã‚’ã¨ã£ã¦ãŠã‚Šã€æ¬¡ã®ã‚ˆã†ã«ãªã£ã¦ã„ã¾ã™ã€‚ 1st stage: å€™è£œç”Ÿæˆ ä»¥ä¸‹ã®2ã¤ã®çµŒè·¯ã‹ã‚‰ãƒ¦ãƒ¼ã‚¶ãŒèˆˆå‘³ã‚’æŒã¡ãã†ãªå€™è£œã‚¢ã‚¤ãƒ†ãƒ ã‚’é«˜é€Ÿã«çµžã‚Šè¾¼ã‚€ ãƒ•ã‚©ãƒãƒ¼ä¸ã®ã‚¢ã‚«ã‚¦ãƒ³ãƒˆã®æŠ•ç¨¿ (In-Net
masterq 2026/03/15
twitter

algorithm
ãƒªãƒ³ã‚¯
w.l.o.g.
04:40 04/06/04 ãƒ”ãƒ¼ã‚¹ãƒ†ãƒ¼ãƒ–ãƒ« PieceTable ã¨ã‚‚è¨€ã†ã€‚æ–‡å—åˆ—ã® Pieceï¼ˆå°ç‰‡ï¼‰ã‚’ç¹‹ã’ã¦ã€ ä¸€ã¤ã®å·¨å¤§ãªæ–‡æ›¸ã‚’è¡¨ç¾ã™ã‚‹æ–¹å¼ã€‚ æ¤œç´¢ã™ã‚‹ã¨å¼•ã£ã‹ã‹ã‚‹æ–‡æ›¸ã®ã»ã¨ã‚“ã©ãŒ AbiWord é–¢ä¿‚ãªã®ã§ã€ ã“ã®ãƒ¯ãƒ¼ãƒ—ãƒã‚½ãƒ•ãƒˆã®ä¸»è¦ãªå†…éƒ¨ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã„ã†ã“ã¨ãªã®ã‹ãªã€‚ ä»–ã«ã€MS-Wordã‚„OpenOffice.orgé–¢é€£ã®æ–‡æ›¸ã«ã‚‚ç™»å ´ã—ã¦ã„ã¦ã€ åŸºæœ¬çš„ã«å˜ãªã‚‹ãƒ†ã‚ã‚¹ãƒˆã‚¨ãƒ‡ã‚£ã‚¿ã‚ˆã‚Šã¯ã€æ–‡å—ã«ä»˜åŠ æƒ…å ±ã‚’ãã£ã¤ã‘ã‚‹ç³»ã® ç·¨é›†ã‚½ãƒ•ãƒˆã«ä½¿ã‚ã‚Œã‚‹å ´é¢ãŒä»Šã®ã¨ã“ã‚å¤šã„ã¿ãŸã„ã§ã™ã€‚ ä½™è«‡ã§ã™ãŒAbiWordã¯ã€ç¶±æ¸¡ã‚Šçš„ã«ã§ã™ãŒBeOSç‰ˆã®é–‹ç™ºãŒç¶šã„ã¦ã„ã‚‹è²´é‡ãªãƒ¯ãƒ¼ãƒ—ãƒã‚½ãƒ•ãƒˆãªã®ã§ã™ã€‚æ„Ÿè¬æ„Ÿè¬ã€‚ æ¦‚è¦ ãƒ•ã‚¡ã‚¤ãƒ«ã‚’èªã¿è¾¼ã‚“ã ã¨ã—ã¾ã—ã‚‡ã†ã€‚ABCDEFGã€ã¨ã„ã†ï¼—æ–‡å—ã®ãƒ•ã‚¡ã‚¤ãƒ«ã€‚ ã¨ã‚Šã‚ãˆãšã€ï¼—æ–‡å—åˆ†ã®Origã¨ã„ã†åå‰ã®ãƒãƒƒãƒ•ã‚¡ã‚’ç”¨æ„ã—ã¦ã€ãã“ã«æ ¼ç´ã—ã¾ã™ã€‚ ãã‚Œã¨åˆ¥ã«ã€Addã¨ã„ã†åå‰ã®ç©ºã®ãƒ
masterq 2025/07/12
"ã€Œãƒ¡ãƒ¢ãƒªã®è¨±ã™é™ã‚Šç„¡åˆ¶é™Undoã€ã¨ã„ã†æ©Ÿèƒ½ã‚’ å®Ÿç¾ã™ã‚‹ã«ã¯ã€ã©ã®é“ã€å…¨ã¦ã®å…¥åŠ›ãƒ‡ãƒ¼ã‚¿ã‚’ä¿æŒã—ã¦ãŠã‹ãªã„ã¨ã„ã‹ã‚“ã®ã§ã™ã€‚ PieceTableæ³•ã®å ´åˆã€å…¨ã¦ã®å…¥åŠ›ã‚’ä¸€åˆ—ã«ã€ ãƒ¡ãƒ¢ãƒªã‚’éš™é–“ç„¡ãæœ‰åŠ¹åˆ©ç”¨ã—ãŸçŠ¶æ…‹ã§æ ¼ç´"

editor

algorithm

undo
ãƒªãƒ³ã‚¯
ãƒ†ã‚ã‚¹ãƒˆã‚¨ãƒ‡ã‚£ã‚¿ã§ä½¿ã‚ã‚ŒãŒã¡ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ Piece Table ã®æ¦‚è¦ã¨å®Ÿè£… - A Memorandum
ãƒ†ã‚ã‚¹ãƒˆã‚¨ãƒ‡ã‚£ã‚¿ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ Gap method Piece Table method Piece Table ã®æ§‹é€ Piece Table ã®å®Ÿè£… Piece Table ã®ãƒ¡ã‚½ãƒƒãƒ‰ ã¾ã¨ã‚ ãƒ†ã‚ã‚¹ãƒˆã‚¨ãƒ‡ã‚£ã‚¿ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ãƒ†ã‚ã‚¹ãƒˆã‚¨ãƒ‡ã‚£ã‚¿ã§æŽ¡ç”¨ã•ã‚Œã¦ã„ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«ã¯ã„ã‚ã„ã‚ã‚ã‚Šã¾ã™ã€‚ ã“ã¡ã‚‰ã®è«–æ–‡ Data Structures for Text Sequences ã§ã¯å„ç¨®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«ã¤ã„ã¦æ¯”è¼ƒæ¤œè¨Žã•ã‚Œã¦ã„ã¾ã™ã€‚ å¤šãã¯ã€Gap method ã‚„ Piece table method ã‚’ãƒ™ãƒ¼ã‚¹ã«ã—ãŸã‚‚ã®ãŒå¤šã„ã®ã§ã¯ãªã„ã§ã—ã‚‡ã†ã‹(å›³ã§è¨€ã†æœ€ä¸‹éƒ¨ã®ä¸å¿ƒã®ä¸¸å°ã«å½“ãŸã‚Šã¾ã™)ã€‚æœ€è¿‘ã§ã¯ Rope ãªã©ã‚‚æœ‰åã§ã™ãã€‚ Gap method Gap method ã§ã¯ã€ç¾åœ¨ã®ã‚«ãƒ¼ã‚½ãƒ«ä½ç½®ã§ã€ãƒ†ã‚ã‚¹ãƒˆãƒãƒƒãƒ•ã‚¡ã‚’2ã¤ã«åˆ†å‰²ã— Gap ã‚’é–“ã«æŒŸã¿ã€ã‚«ãƒ¼ã‚½ãƒ«ä½ç½®ã«å¯¾ã™ã‚‹ç·¨é›†(ãƒ†ã‚ã‚¹ãƒˆè¿½åŠ /å‰Šé™¤)ã‚’
masterq 2025/07/12
editor

algorithm
ãƒªãƒ³ã‚¯
ã€C++ã€‘ãƒ†ã‚ã‚¹ãƒˆã‚¨ãƒ‡ã‚£ã‚¿ã®ãƒãƒƒãƒ•ã‚¡ ãƒ‡ãƒ¼ã‚¿æ§‹é€ ãƒ»ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€ç¬¬ï¼“å›žã€‘ | TECH PROjin
ç›®æ¬¡ gap_buffer<char> gap_buffer<char> å‰ç« ã§ã‚‚è¨€åŠã—ãŸã‚ˆã†ã«ã€ãƒ†ã‚ã‚¹ãƒˆã‚¨ãƒ‡ã‚£ã‚¿ã«ãŠã„ã¦ã¯ãƒ†ã‚ã‚¹ãƒˆã®å‚ç…§ãƒ»ç·¨é›†ç®‡æ‰€ã¯å±€æ‰€åŒ–ã•ã‚Œã¦ã„ã‚‹ã€‚ ã“ã®æ€§è³ªã‚’åˆ©ç”¨ã—ã€vector ã‚’é«˜é€ŸåŒ–ã—ãŸã‚‚ã®ãŒ gap_buffer ï¼ˆã‚®ãƒ£ãƒƒãƒ—ãƒãƒƒãƒ•ã‚¡ã€gap vector ã¨ã‚‚å‘¼ã°ã‚Œã‚‹ï¼‰ã ã€‚ vector ã¨ gap_buffer ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®é•ã„ã¯å°‘ãªãã€å‰è€…ãŒã‚¢ãƒã‚±ãƒ¼ãƒˆã—ãŸãƒ‡ãƒ¼ã‚¿é ˜åŸŸã®å¾Œã‚ã«æœªä½¿ç”¨éƒ¨åˆ†ãŒã‚ã‚‹ã®ã«å¯¾ã—ã¦ã€ å¾Œè€…ã¯ãƒ‡ãƒ¼ã‚¿é ˜åŸŸã®é€”ä¸ã«æœªä½¿ç”¨éƒ¨åˆ†ãŒã‚ã‚‹ã¨ã„ã†ç‚¹ã ã‘ã ï¼ˆä¸‹å›³å‚ç…§ï¼‰ã€‚ ã“ã®æœªä½¿ç”¨éƒ¨åˆ†ã‚’ã€Œã‚®ãƒ£ãƒƒãƒ—ã€ã¨å‘¼ã³ã€å¸¸ã«ç·¨é›†ä½ç½®ã«è¨å®šã•ã‚Œã‚‹ã€‚ ã“ã®ã‚ˆã†ã«ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’å°‘ã—å¤‰ãˆãŸã ã‘ã§ã€ãªãœé«˜é€ŸåŒ–ã•ã‚Œã‚‹ã®ã‹ä¸æ€è°ã«æ€ã‚ã‚Œã‚‹æ–¹ã‚‚å°‘ãªããªã„ã ã‚ã†ãŒã€ é«˜é€Ÿã«ãªã‚‹ç†ç”±ã¯ã€æŒ¿å…¥ãƒ»å‰Šé™¤æ™‚ã«ä½•ãŒèµ·ã“ã‚‹ã‹ã‚’è¦‹ã¦ã¿ã‚‹ã¨ç´å¾—ã—ã¦ã„ãŸã ã‘ã‚‹ã¯ãšã ã€‚ ç·¨é›†ä½ç½®ã« â€˜aâ€™, â€˜bâ€™ ãŒæŒ¿å…¥ã•
masterq 2025/07/12
c++

editor

algorithm
ãƒªãƒ³ã‚¯
ãƒ†ã‚ã‚¹ãƒˆã‚¨ãƒ‡ã‚£ã‚¿ã‚’ä½œã‚‹
ã“ã“ã®è¨˜äº‹ã‚’æ›´æ–°ã™ã‚‹ã®ã¯ç´„1å¹´ã¶ã‚Šã€‚å¤ã®é–“ã¯éŠã‚“ã§ã„ãŸã‚Šç§‹ã‹ã‚‰ã¯ä»•äº‹ãŒå¿™ã—ããªã£ãŸã‚Šã®è¿‘æ³ã ã£ãŸã€‚ ã‚³ãƒãƒŠã‚¦ã‚£ãƒ«ã‚¹ã§è‡ªå®…ã«é–‰ã˜è¾¼ã‚ã‚‰ã‚Œã¦ã—ã¾ã£ãŸã®ã§ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ç·´ç¿’ã®ãŸã‚ã«ãƒ†ã‚ã‚¹ãƒˆã‚¨ãƒ‡ã‚£ã‚¿ã‚’ä½œã£ã¦ã¿ãŸã€‚ å¾—ã‚‰ã‚ŒãŸçŸ¥è¦‹ãªã©ã‚’ç´¹ä»‹ã—ã‚ˆã†ã€‚ ç›®æ¨™ã¨ã—ã¦ã„ã‚‹æ©Ÿèƒ½ãƒ»å®Ÿè£… ç·´ç¿’ãƒ»æ•™æç”¨ã¨ã—ã¦ååˆ†ãªå°ã•ã•ã€‚ è¨˜äº‹ã®ãƒã‚¿ã«ãªã‚‹ã€‚ã¾ãŸã€ä½œã£ã¦ã„ã¦é£½ããªã„ã€‚ã²ã¨ç¯ã‚‚ã‚Šã™ã‚‹ãƒ—ãƒã‚¸ã‚§ã‚¯ãƒˆã¨ã—ã¦é©åˆ‡ãªã‚µã‚¤ã‚ºã€‚ æ˜”ã‹ã‚‰ã€ãƒ—ãƒã‚°ãƒ©ãƒžãªã‚‰ä½œã£ã¦ã¿ãŸã„ã‚‚ã®ã¨ã—ã¦ã€(1)ã‚³ãƒ³ãƒ‘ã‚¤ãƒ© (2)OS (3)ã‚¨ãƒ‡ã‚£ã‚¿ã€ãŒã‚ˆãæŒ™ã’ã‚‰ã‚Œã‚‹ã€‚ã‚³ãƒ³ãƒ‘ã‚¤ãƒ©ã«ã¤ã„ã¦ã¯ä»¥å‰ã«æ›¸ã„ãŸã€‚ä»Šå›žã¯ã‚¨ãƒ‡ã‚£ã‚¿ã«ãƒãƒ£ãƒ¬ãƒ³ã‚¸ã—ã¦ã¿ã‚‹ã“ã¨ã«ã—ãŸã€‚ ãƒ†ã‚ã‚¹ãƒˆã‚¨ãƒ‡ã‚£ã‚¿ã‚’ä½œã‚‹å ´åˆã€GUIãƒ„ãƒ¼ãƒ«ã‚ãƒƒãƒˆã‚’ä½¿ã£ã¦ä½œæˆã™ã‚‹ã“ã¨ã‚‚è€ƒãˆã‚‰ã‚Œã‚‹ãŒã€ä»Šå›žã¯viã®ã‚ˆã†ã«ã‚¿ãƒ¼ãƒŸãƒŠãƒ«ä¸Šã§å‹•ä½œã™ã‚‹ã‚¿ã‚¤ãƒ—ã®ã‚‚ã®ã‚’ä½œã‚‹ã€‚æ™‚é–“ãŒã‚ã‚Œã°ã€æ¬¡ã®æ§˜ãªç™ºå±•çš„ãªç›®æ¨™ã‚‚æ¤œè¨Žã—ãŸã„ã€‚ è¨å®šå¤‰æ›´æ©Ÿèƒ½ã‚’æŒã¤ï¼ˆã
masterq 2025/07/02
rust

text

editor

algorithm
ãƒªãƒ³ã‚¯
blog dds: 2006-06-26 â€” Dave Prosser's C Preprocessing Algorithm
For about five years I've been trying to implement a fully conforming C preprocessor for the front end of the CScout refactoring browser. I've found this to be a fiendishly difficult task. Although what I have written can correctly process million-line real-life projects, every once in a while I come across a construct that confuses my implementation. While searching the web for explanations of so
masterq 2024/12/01
c

algorithm

macro

cpp

pdf

language

specification

spec
ãƒªãƒ³ã‚¯
Goã§ä½œã‚‹ãƒ†ã‚ã‚¹ãƒˆã‚¨ãƒ‡ã‚£ã‚¿ - Sansan Tech Blog
ã¯ã˜ã‚ã« ã¿ãªã•ã‚“ã“ã‚“ã«ã¡ã¯ã€‚Sansanäº‹æ¥éƒ¨ãƒ—ãƒãƒ€ã‚¯ãƒˆé–‹ç™ºéƒ¨ã®iOSã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢è’å·ã§ã™ã€‚ ä»¥å‰ã¯RDBMSã®è¨˜äº‹*1ã‚’å¯„ç¨¿ã—ã€å¥½è©•ã„ãŸã ã„ãŸã“ã¨ã‚‚ã‚ã‚Šã€å®šæœŸçš„ã«è»Šè¼ªã®å†ç™ºæ˜Žç³»ã®è¨˜äº‹ã‚’æ›¸ã„ã¦ã„ã“ã†ã¨æ€ã„ã¾ã™ã€‚ ã•ã¦æœ¬æ—¥ã¯ã‚¿ã‚¤ãƒˆãƒ«ã®é€šã‚Šã€Vimã‚„Emacsã«ä»£è¡¨ã•ã‚Œã‚‹ã‚¿ãƒ¼ãƒŸãƒŠãƒ«ã§å‹•ä½œã™ã‚‹ã‚¤ãƒ³ãƒ©ã‚¤ãƒ³ãƒ†ã‚ã‚¹ãƒˆã‚¨ãƒ‡ã‚£ã‚¿ã‚’Goã§é–‹ç™ºã—ã¦ã¿ã¾ã—ãŸã€‚ ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ã¯ä»¥ä¸‹ã®ãƒªãƒã‚¸ãƒˆãƒªã«ç½®ã„ã¦ã„ã‚‹ãŸã‚ã€ãœã²å‚è€ƒã«ã—ã¦ãã ã•ã„ã€‚ github.com å®Œæˆå“ æ–‡å—ã ã‘ã ã¨ã‚¤ãƒ¡ãƒ¼ã‚¸ã‚‚æ¹§ãã«ãã„ã®ã§ã€ã¾ãšã¯å®Œæˆå“ã‚’ãŠè¦‹ã›ã—ã¾ã™ã€‚ æœ€ä½Žé™ã‚¨ãƒ‡ã‚£ã‚¿ã®å‹•ãã¯å‡ºæ¥ã¦ã„ã‚‹ã€ã¨ã„ã†ãƒ¬ãƒ™ãƒ«ã®å®Œæˆåº¦ã§ã™ãðŸ™ ç‰¹å¾´ 1000è¡Œã‚¤ãƒ³ãƒ©ã‚¤ãƒ³ã‚¨ãƒ‡ã‚£ã‚¿ æ–‡å—å…¥åŠ›/æŒ¿å…¥/å‰Šé™¤ ç”»é¢ã‚¹ã‚¯ãƒãƒ¼ãƒ« ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆ ãƒ•ã‚¡ã‚¤ãƒ«èªã¿è¾¼ã¿/ä¿å˜ Goã®ã‚³ãƒ¼ãƒ‰ãƒã‚¤ãƒ©ã‚¤ãƒˆæ©Ÿèƒ½ å®Ÿè£…ã®æ–¹é‡ ä»Šå›žã¯ãŸã é–‹ç™ºã™ã‚‹ã ã‘ã§ã¯ãªãã€ã„ãã¤ã‹ã®ã“ã ã‚ã‚Šãƒã‚¤ãƒ³
masterq 2023/08/04
"Emacsã§ã‚‚æŽ¡ç”¨ã•ã‚Œã¦ã„ã‚‹GapBufferï¼ˆGapTableï¼‰ã¨ã„ã†ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’æŽ¡ç”¨ã™ã‚‹ã“ã¨ã«ã—ã¾ã—ãŸ"

go

emacs

editor

language

algorithm
ãƒªãƒ³ã‚¯
Beautiful Branchless Binary Search
I read a blog post by Alex Muscar, â€œBeautiful Binary Search in Dâ€œ. It describes a binary search called â€œSharâ€™s algorithmâ€. Iâ€™d never heard of it and itâ€™s impossible to google, but looking at the algorithm I couldnâ€™t help but think â€œthis is branchless.â€ And who knew that there could be a branchless binary search? So I did the work to translate it into a algorithm for C++ iterators, no longer requir
masterq 2023/04/30
binary

search

algorithm

c++
ãƒªãƒ³ã‚¯
AtCoder Problems
Manage your AtCoder probl ems.
masterq 2023/04/15
programming

atcorder

algorithm
ãƒªãƒ³ã‚¯
Binary search with modern processors
ç¬¬16å›ž StringBeginners ã§ã®ç™ºè¡¨è³‡æ–™
masterq 2021/06/14
slide

doc

japanese

binary

search

cpu

algorithm

fast

performance

memory
ãƒªãƒ³ã‚¯
Big-O Algorithm Complexity Cheat Sheet (Know Thy Complexities!) @ericdrowell
Hi there!Â This webpage covers the space and time Big-O complexities of common algorithms used in Computer Science.Â When preparing for technical interviews in the past, I found myself spending hours crawling the internet putting together the best, average, and worst case complexities for search and sorting algorithms so that I wouldn't be stumped when asked about them.Â Over the last few years, I
masterq 2021/05/27
algorithm

cheatsheet

bigo
ãƒªãƒ³ã‚¯
Learn X in Y Minutes: Scenic Programming Language Tours
Take a whirlwind tour of your next favorite language. Community-driven! Languages Translations
masterq 2021/01/17
education

programming

language

algorithm

data

structure
ãƒªãƒ³ã‚¯
ã€ŒGoã®çˆ¶ã€ãƒãƒ–ãƒ»ãƒ‘ã‚¤ã‚¯ã®ã€Œãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°5ã‚«æ¡ã€ã€ãƒãƒƒãƒˆä¸Šã§è©±é¡Œã«
ã€ŒUNIXã¯ãŸã æ»ã‚“ã ã ã‘ã§ãªãã€æœ¬å½“ã«ã²ã©ã„è‡ã„ã‚’æ”¾ã¡å§‹ã‚ã¦ã„ã‚‹ã€ã€Œã‚ãƒ£ãƒƒã‚·ãƒ¥ã¯ã‚¢ãƒ¼ã‚ãƒ†ã‚¯ãƒãƒ£ã§ã¯ãªã„ã€‚å˜ãªã‚‹æœ€é©åŒ–ã ã€ãªã©ã®èªžéŒ²ã‚’ç”Ÿã‚“ã ã€ŒGoã®çˆ¶ã€ã¨ã‚‚å‘¼ã°ã‚Œã‚‹ãƒãƒ–ãƒ»ãƒ‘ã‚¤ã‚¯æ°ã®ã€Œãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°5ã‚«æ¡ã€ã«ã¤ã„ã¦ã€ãƒãƒƒãƒˆä¸Šã§è©±é¡Œã¨ãªã£ã¦ã„ã¾ã™ users.ece.utexas.edu/~adnan/pike.html http://users.ece.utexas.edu/~adnan/pike.html Rob Pike's Rules of Programming (1989) | Hacker News https://news.ycombinator.com/it em?id=24135189 ãƒ‘ã‚¤ã‚¯æ°ã®ã€Œãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°5ã‚«æ¡ã€ã¯ä»¥ä¸‹ã€‚ ãƒ«ãƒ¼ãƒ«1ï¼šãƒ—ãƒã‚°ãƒ©ãƒ ã®ã©ã“ã§å‡¦ç†æ™‚é–“ãŒã‹ã‹ã‚‹ã‹ã¯ã‚ã‹ã‚‰ãªã„ã€‚ãƒœãƒˆãƒ«ãƒãƒƒã‚¯ã¯æ„å¤–ãªå ´æ‰€ã§ç™ºç”Ÿã™ã‚‹ã®ã§ã€ãƒœãƒˆãƒ«ãƒãƒƒã‚¯ãŒã©ã“ã«ã‚ã‚‹ã‹ã‚’è¨¼æ˜Žã™ã‚‹ã¾ã§ã¯ã€è‡†æ¸¬
masterq 2020/08/17
algorithm

software

doc

japanese

performance

benchmark
ãƒªãƒ³ã‚¯
GitHub - johnmeacham/lzjwm: lzjwm tiny ascii compression algorithm.
masterq 2020/08/10
john

compress

algorithm

ascii
ãƒªãƒ³ã‚¯
ã€Œä¸å®‰ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€ã‚’å®Ÿéš›ã«é–‹ç™ºã—ã¦èµ°ã‚‰ã›ã‚‹ã“ã¨ã§ä¸å®‰ã®åŽŸå› ã¨è§£æ±ºæ³•ã‚’æŽ¢ã‚‹
æ—¥å¸¸çš„ã«æŠ±ã„ã¦ã—ã¾ã†ã€Œä¸å®‰ã€ã‚’ã‚³ãƒ³ãƒˆãƒãƒ¼ãƒ«ã™ã‚‹ã«ã¯ã©ã†ã™ã‚Œã°ã„ã„ã®ã‹ã€ã¨ã„ã†ã“ã¨ã‚’æŽ¢ã‚‹ãŸã‚ã€2020å¹´1æœˆã«ã‚µãƒ¼ãƒ“ã‚¹ãŒçµ‚äº†ã—ãŸæ—…è¡Œæ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³ã€ŒHipmunkã€ã®å…±åŒå‰µæ¥è€…ã§ã‚ã‚‹ã‚¢ãƒ€ãƒ ãƒ»ã‚´ãƒ¼ãƒ«ãƒ‰ã‚¹ã‚¿ã‚¤ãƒ³æ°ãŒã€ã€Œä¸å®‰ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€ã‚’é–‹ç™ºã—ã€å®Ÿéš›ã«ã‚·ãƒŸãƒ¥ãƒ¬ãƒ¼ã‚·ãƒ§ãƒ³ã‚’è¡Œã†ã“ã¨ã§ä¸å®‰ã®åŽŸå› ã‚„è§£æ±ºç–ã‚’èª¬æ˜Žã™ã‚‹ã¨ã„ã†è©¦ã¿ã‚’è¡Œã£ã¦ã„ã¾ã™ã€‚ The Contagion of Concern â€” Adam Julian Goldstein https://www.adamjuliangoldstein.com/blog/contagion-of-concern/ ã‚´ãƒ¼ãƒ«ãƒ‰ã‚¹ã‚¿ã‚¤ãƒ³æ°ã¯Hipmunkã‚’é‹ç”¨ã™ã‚‹ä¸ã§ã€ã€Œç‰©äº‹ãŒã†ã¾ãã„ã£ã¦ã„ã‚‹æ™‚ã«ã„ã„å‡ºæ¥äº‹ãŒèµ·ã“ã‚‹ã¨æ°—åˆ†ãŒã‚ˆããªã‚‹ãŒã€ç‰©äº‹ãŒã†ã¾ãã„ã£ã¦ã„ãªã„æ™‚ã«ã„ã„å‡ºæ¥äº‹ãŒèµ·ã“ã£ã¦ã‚‚ã€Žã„ã„ã“ã¨ã€ã ã¨è¦‹ãªã›ãªã„ã€ã“ã¨ã«æ°—ã¥ãã¾ã—ãŸã€‚ãªãœç¾å®Ÿã®ç‰©äº‹ãŒè‡ªåˆ†ã®èªçŸ¥ã«å½±éŸ¿
masterq 2020/06/05
æœ€åˆã¯å¤ãã‹ã‚‰ã‚ã‚‹ãƒªã‚¹ã‚¯ã®äºˆæƒ³ã¨ç®¡ç†ã®è©±ãªã®ã‹ãªã¨æ€ã£ãŸã‚‰ã€å¾ŒåŠç²¾ç¥žè«–ã«ãªã£ãŸã€‚

risk

algorithm

mind

human
ãƒªãƒ³ã‚¯
Cholesky decomposition - Rosetta Code
masterq 2020/02/14
math

c

algorithm

cholesky
ãƒªãƒ³ã‚¯
https://www.cec.uchile.cl/cinetica/pcordero/MC_libros/NumericalRecipesinC.pdf
masterq 2019/12/04
ãªã‚“ã ã‚ˆã€‚ã€‚ã€‚Cè¨€èªžã§æ•°å€¤è¨ˆç®—ã™ã‚‹ãªã‚‰å¿…èªæœ¬ã˜ã‚ƒãªã„ã‹ã€‚ã€‚ã€‚ã‚‚ã£ã¨æ—©ãçŸ¥ã‚ŠãŸã‹ã£ãŸã€‚ã€‚ã€‚

math

c

language

linear_algebra

algorithm

random

sort

eigen

fft
ãƒªãƒ³ã‚¯
ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’é«˜é€ŸåŒ–ã™ã‚‹è©±
â€œSymbolic bounds analysis of pointers, array indices, and accessed memory reg...
masterq 2019/08/29
performance

simd

bit

algorithm

slide

japanese
ãƒªãƒ³ã‚¯
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å›³é‘‘ - Google Play ã®ã‚¢ãƒ—ãƒª
è¦‹ã¦åˆ†ã‹ã‚‹ã€è©¦ã—ã¦åˆ†ã‹ã‚‹ãŸã®ã—ã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®å›³é‘‘ã€‚å¹…åºƒã„åˆ†é‡Žã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ã€ã‚¢ãƒ‹ãƒ¡ãƒ¼ã‚·ãƒ§ãƒ³ã§ã‚„ã•ã—ãè§£èª¬ã€‚ã•ã¾ã–ã¾ã«è©¦ã›ã‚‹å®Ÿé¨“ãƒ¢ãƒ¼ãƒ‰ã§ç†è§£ãŒã•ã‚‰ã«é€²ã¿ã¾ã™ã€‚æš—å·åŒ–ã€ã‚»ã‚ãƒ¥ãƒªãƒ†ã‚£ãªã©èº«è¿‘ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚‚æº€è¼‰ã€‚ã•ã‚ã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®ä¸–ç•Œã«æ—…ç«‹ã¡ã¾ã—ã‚‡ã†ï¼ ã€ ã‚«ãƒ†ã‚´ãƒªã¨æŽ²è¼‰é …ç›®ä¾‹ ã€‘ ã€Š ã‚½ãƒ¼ãƒˆ ã€‹ ãƒãƒ–ãƒ«ã‚½ãƒ¼ãƒˆã€ãƒ’ãƒ¼ãƒ—ã‚½ãƒ¼ãƒˆã€ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆãªã©ï¼–é …ç›® ã€Š ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚° ã€‹ k-meansæ³• ã€Š ãƒªã‚¹ãƒˆæŽ¢ç´¢ ã€‹ ç·šå½¢æŽ¢ç´¢ã€ï¼’åˆ†æŽ¢ç´¢ ã€Š ã‚°ãƒ©ãƒ•æŽ¢ç´¢ ã€‹ å¹…å„ªå…ˆãƒ»æ·±ã•å„ªå…ˆæŽ¢ç´¢ã€ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ã€ï¼¡ï¼Š(ã‚¨ãƒ¼ãƒ»ã‚¹ã‚¿ãƒ¼)ãªã©ï¼•é …ç›® ã€Š æ•°å¦ ã€‹ ãƒ¦ãƒ¼ã‚¯ãƒªãƒƒãƒ‰ã®äº’é™¤æ³•ã€ç´ æ•°åˆ¤å®šæ³• ã€Š ãƒ‡ãƒ¼ã‚¿åœ§ç¸® ã€‹ ãƒãƒ•ãƒžãƒ³ç¬¦å·ã€ãƒ©ãƒ³ãƒ¬ãƒ³ã‚°ã‚¹ç¬¦å· ã€Š ã‚»ã‚ãƒ¥ãƒªãƒ†ã‚£ ã€‹ ã‚»ã‚ãƒ¥ãƒªãƒ†ã‚£ãƒ»æš—å·ã®åŸºç¤Žã€å…±é€šéµãƒ»å…¬é–‹éµæš—å·æ–¹å¼ã€ãƒ‡ã‚¸ã‚¿ãƒ«ç½²åãƒ»è¨¼æ˜Žæ›¸ãªã©10é …ç›® ã€Š ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã€‹ ãƒªã‚¹ãƒˆãƒ»é…åˆ—ã€ã‚¹ã‚¿ãƒƒã‚¯ãƒ»ã‚ãƒ¥ãƒ¼ã€ï¼’åˆ†æŽ¢ç´¢æœ¨ãªã©ï¼—
masterq 2019/08/06
ãªã‚“ã¨ãƒ¼ã€ã“ã‚“ãªã‚‚ã®ãŒ

algorithm

education

learning

animation

japanese

android
ãƒªãƒ³ã‚¯
è¨ˆç®—é‡ã‚ªãƒ¼ãƒ€ãƒ¼ã®æ±‚ã‚æ–¹ã‚’ç·æ•´ç†ï¼ ã€œ ã©ã“ã‹ã‚‰ log ãŒå‡ºã¦æ¥ã‚‹ã‹ ã€œ - Qiita
NTT ãƒ‡ãƒ¼ã‚¿æ•°ç†ã‚·ã‚¹ãƒ†ãƒ ã§ãƒªã‚µãƒ¼ãƒãƒ£ãƒ¼ã‚’ã—ã¦ã„ã‚‹å¤§æ§» (é€šç§°ã€ã‘ã‚“ã¡ã‚‡ã‚“) ã§ã™ã€‚ä»Šå›žã¯è¨ˆç®—é‡ã‚ªãƒ¼ãƒ€ãƒ¼ã®æ±‚ã‚æ–¹ã«ã¤ã„ã¦æ›¸ãã¾ã™ã€‚ 0. ã¯ã˜ã‚ã« ä¸–ã®ä¸ã®æ§˜ã€…ãªã‚·ã‚¹ãƒ†ãƒ ã‚„ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã¯ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã‚ˆã£ã¦æ”¯ãˆã‚‰ã‚Œã¦ã„ã¾ã™ã€‚Qiita Contribution ãƒ©ãƒ³ã‚ãƒ³ã‚°ä½œæˆã®ãŸã‚ã«ç”¨ã„ã‚‹ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®ã‚ˆã†ãªå˜ç´”ãªã‚‚ã®ã‹ã‚‰ã€ã‚«ãƒ¼ãƒŠãƒ“ã«ä½¿ã‚ã‚Œã¦ã„ã‚‹ Dijkstra æ³•ã€æµè¡Œä¸ã®ãƒ‡ã‚£ãƒ¼ãƒ—ãƒ©ãƒ¼ãƒ‹ãƒ³ã‚°ã«ç”¨ã„ã‚‰ã‚Œã¦ã„ã‚‹ç¢ºçŽ‡çš„å‹¾é…é™ä¸‹æ³•ãªã©ã€æ§˜ã€…ãªå ´é¢ã§ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒæ´»èºã—ã¦ã„ã¾ã™ã€‚ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã¯ã©ã‚“ãªã‚‚ã®ã‹ã«ã¤ã„ã¦å…·ä½“çš„ã«çŸ¥ã‚ŠãŸã„æ–¹ã«ã¯ä»¥ä¸‹ã®è¨˜äº‹ãŒå‚è€ƒã«ãªã‚‹ã¨æ€ã„ã¾ã™: ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã¯ä½•ã‹ ï½ž æ–‡ç³»ç†ç³»å•ã‚ãšæ¥½ã—ã‚ã‚‹ç²¾é¸ 6 å• ï½ž ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’å¦ã¶ã¨ $O(n^2)$ ã‚„ $O(n\log{n})$ ã‚„ $O(2^n)$ ã¨ã„ã£ãŸè¨ˆç®—é‡ã‚ªãƒ¼ãƒ€ãƒ¼ã®æ¦‚å¿µãŒç™»å ´ã—ã¾ã™ã€‚ã“ã†ã—ãŸè¨˜æ³•ã‚’è¦‹ã‚‹ã¨
masterq 2019/08/03
algorithm

japanese
ãƒªãƒ³ã‚¯
1 2 3 æ¬¡ã®ãƒšãƒ¼ã‚¸