Results For Bitwise Radix MSD Sort (Linked):
  accesses(n) =  4.06n

Results For Counting Sort:
  accesses(n) =  5.00n

Results For Bitwise Radix LSD Sort (In Place Linked):
  accesses(n) =  12.00n + 384.00

Results For Bitwise Radix LSD Sort (Linked):
  accesses(n) =  0.31nlogn + 9.28n

Results For Merge Sort (Linked):
  accesses(n) =  1.46nlogn + 3.03n + 1.39

Results For Merge Sort (Aggressive Out-of-Place):
  accesses(n) =  1.93nlogn + 1.32n

Results For Quick Sort:
  accesses(n) =  2.04nlogn + 1.19n + 1.46

Results For Quick Sort (Linked):
  accesses(n) =  2.16nlogn + 11.44

Results For Merge Sort (Out-of-Place):
  accesses(n) =  2.89nlogn + 0.65n

Results For Bitwise Radix MSD Sort (In Place Linked):
  accesses(n) =  41.46n

Results For Shell Sort:
  accesses(n) =  3.56nlogn + 1.34n

Results For Heap Sort (Max):
  accesses(n) =  4.91nlogn + 4.32

Results For Selection Sort (Linked):
  accesses(n) =  0.50n^2 + 0.50n

Results For Selection Sort:
  accesses(n) =  0.50n^2 + 3.50n

Results For Gravity Sort:
  accesses(n) =  0.50n^2 + 4.50n

Results For Merge Sort (In Place: Standard):
  accesses(n) =  0.73n^2 + 8.53n

Results For Merge Sort (In Place: Shaker):
  accesses(n) =  0.73n^2 + 12.94n

Results For Merge Sort (In Place: Weave):
  accesses(n) =  0.80n^2 + 7.76nlogn + 47.19

Results For Insertion Sort:
  accesses(n) =  0.99n^2 + 39.70n

Results For Cocktail Shaker Sort:
  accesses(n) =  1.07n^2 + 32.39n

Results For Bubble Sort:
  accesses(n) =  1.22n^2 + 0.86nlogn + 14.30

Results For Pancake Sort:
  accesses(n) =  1.63n^2 + 7.55n