Adaptive sort

适应性堆排序法（adaptive heap sort） 适应性霍夫曼编码（adaptive Huffman coding） 适应性k-d树（adaptive k-d tree） 适应性排序（adaptive sort） 地址计算排序（address-calculation sort） 邻接表（adjacency-list

l)，它等同于对反转过的列表应用变体插入排序。 希尔排序算法是对插入排序的改进，保持了自适应性（英语：Adaptive sort），放弃了稳定性。 下面是希尔排序的实现： fun shellSort l = let fun insert pred (ins, l) = let fun loop (acc

memory is for. Behavioral and Brain Sciences 20:1–19 Sloman, A. 1999. What Sort of Architecture is Required for a Human-like Agent? （页面存档备份，存于互联网档案馆） In

or methods for realizing such results. 原文：He had no hobby, cared for no sort of amusement of any kind and lived in utter disregard of the most elementary

applications ERMA, and computer manufacturing 貝蒂·霍爾伯頓（英语：Betty Holberton） Sort-merge generator for the Univac and compilation 1996 Angel Angelov Computer