Linear Sortï¼ç·å½¢ã½ã¼ãï¼ function LinearSort(list): StartTime=Time() MergeSort(list) Sleep(1e6*length(list)-(Time()-StartTime)) return How to sort a list in linear time ï¼ç·å½¢æéã§ãªã¹ããã½ã¼ãããæ¹æ³ï¼ Alt-text: The best case is O(n), and the worst case is that someone checks why. ï¼æè¯ã®ã±ã¼ã¹ã¯O(n)ã§ãææªã®ã±ã¼ã¹ã¯èª°ããçç±ããã§ãã¯ãããã¨ã ãï¼ xkcd: Linear Sort https://xkcd.com/3026/ è£è¶³ ãç·å½¢æéã§ãªã¹ããã½ã¼ãããã¤ã¾ããã½ã¼ãããæ°ã«å¿ãã¦ã½ã¼ãæéãå¢ãã¦ããã½ã¼ãé¢æ°ã XKCDã«ãã´ãª
{{#tags}}- {{label}}
{{/tags}}