插值排序 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "插值排序" in Chinese language version.

refsWebsite
Global rank Chinese rank
1st place
1st place
low place
low place
355th place
411th place

nist.gov

xlinux.nist.gov

  • NIST Algorithm. interpolation sort. [2019-06-14]. (原始内容存档于2019-06-09) (英语). Definition: See histogram sort. 
  • NIST Algorithm. histogram sort. [2019-11-25]. (原始内容存档于2021-03-10) (英语). 

web.archive.org

  • NIST Algorithm. interpolation sort. [2019-06-14]. (原始内容存档于2019-06-09) (英语). Definition: See histogram sort. 
  • en.wikipedia. Histogram sort. [2019-06-14]. (原始内容存档于2021-02-22) (英语). Another variant of bucket sort known as histogram sort or counting sort adds an initial pass that counts the number of elements that will fall into each bucket using a count array. Using this information, the array values can be arranged into a sequence of buckets in-place by a sequence of exchanges, leaving no space overhead for bucket storage. 
  • zh.wikipedia. 桶排序. [2019-06-26]. (原始内容存档于2020-12-05) (中文). 平均時間複雜度 
  • en.wikipedia. Bucket sort Average-case analysis. Wikipedia. [2019-06-14]. (原始内容存档于2021-02-22) (英语). Note that if k is chosen to be , then bucket sort runs in average time, given a uniformly distributed input. 
  • NIST Algorithm. histogram sort. [2019-11-25]. (原始内容存档于2021-03-10) (英语). 
  • en.wikipedia. Proxmap sort. [2019-06-14]. (原始内容存档于2019-07-26) (英语). 
  • en.wikipedia. Flashsort. [2019-06-14]. (原始内容存档于2020-12-20) (英语). 

wikipedia.org

en.wikipedia.org

  • en.wikipedia. Histogram sort. [2019-06-14]. (原始内容存档于2021-02-22) (英语). Another variant of bucket sort known as histogram sort or counting sort adds an initial pass that counts the number of elements that will fall into each bucket using a count array. Using this information, the array values can be arranged into a sequence of buckets in-place by a sequence of exchanges, leaving no space overhead for bucket storage. 
  • en.wikipedia. Bucket sort Average-case analysis. Wikipedia. [2019-06-14]. (原始内容存档于2021-02-22) (英语). Note that if k is chosen to be , then bucket sort runs in average time, given a uniformly distributed input. 
  • en.wikipedia. Proxmap sort. [2019-06-14]. (原始内容存档于2019-07-26) (英语). 
  • en.wikipedia. Flashsort. [2019-06-14]. (原始内容存档于2020-12-20) (英语). 

zh.wikipedia.org

  • zh.wikipedia. 桶排序. [2019-06-26]. (原始内容存档于2020-12-05) (中文). 平均時間複雜度