iankelling.org Git - iankelling.org/blob - _site/on2vote/on2-vote-detailed-analysis.txt

   1 Filtered to one vote per word per ip, and removed voters who did not vary their vote.
   2 median "sounds ok" = 0.310910118711, standard deviation = 0.0494053962862
   3
   4 1st field = "sounds good" to total votes
   5 2nd field = "sounds good" to "sounds wrong or confusing"
   6 3rd field = "sounds ok" to total votes.
   7 4th field = "sound wrong or confusing" to total votes.
   8 big oh of n squared
   9 0.65 0.83 0.22 0.13
  10 oh n squared
  11 0.55 0.71 0.23 0.22
  12 big oh n squared
  13 0.54 0.79 0.31 0.15
  14 oh of n squared
  15 0.54 0.71 0.24 0.22
  16 order n squared
  17 0.49 0.68 0.27 0.24
  18 order of n squared
  19 0.49 0.72 0.32 0.19
  20 complexity of n squared
  21 0.47 0.69 0.32 0.21
  22 quadratic time
  23 0.45 0.61 0.26 0.29
  24 big oh complexity of n squared
  25 0.43 0.62 0.31 0.26
  26 quadratic run time
  27 0.41 0.58 0.29 0.30
  28 computational complexity of n squared
  29 0.38 0.60 0.36 0.25
  30 run time of n squared
  31 0.38 0.53 0.29 0.33
  32 big oh complexity n squared
  33 0.36 0.59 0.39 0.25
  34 quadratic complexity
  35 0.35 0.54 0.35 0.30
  36 order of complexity of n squared
  37 0.35 0.55 0.37 0.28
  38 quadratic time complexity
  39 0.34 0.54 0.37 0.29
  40 time complexity of n squared
  41 0.31 0.47 0.34 0.35
  42 quadratic computational complexity
  43 0.31 0.41 0.26 0.44
  44 algorithmic complexity of n squared
  45 0.30 0.48 0.37 0.32
  46 order of complexity n squared
  47 0.30 0.48 0.38 0.32
  48 time complexity n squared
  49 0.29 0.43 0.33 0.38
  50 complexity n squared
  51 0.29 0.45 0.36 0.35
  52 quadratic growth
  53 0.29 0.43 0.32 0.39
  54 quadratic order of complexity
  55 0.28 0.42 0.33 0.38
  56 run time n squared
  57 0.28 0.45 0.37 0.35
  58 quadratic algorithmic complexity
  59 0.27 0.42 0.35 0.38
  60 big oh efficiency of n squared
  61 0.26 0.41 0.36 0.38
  62 quadratic growth rate
  63 0.26 0.40 0.35 0.39
  64 efficiency of n squared
  65 0.26 0.35 0.26 0.48
  66 growth rate of n squared
  67 0.25 0.38 0.33 0.42
  68 algorithmic complexity n squared
  69 0.25 0.41 0.39 0.36
  70 quadratic big oh
  71 0.24 0.33 0.26 0.49
  72 time efficiency of n squared
  73 0.24 0.35 0.31 0.44
  74 quadratic big oh complexity
  75 0.24 0.40 0.39 0.37
  76 quadratic order
  77 0.24 0.36 0.34 0.42
  78 algorithmic efficiency of n squared
  79 0.24 0.35 0.31 0.45
  80 asymtotic run time of n squared
  81 0.24 0.36 0.33 0.43
  82 growth of n squared
  83 0.23 0.36 0.35 0.41
  84 quadratic time growth rate
  85 0.23 0.31 0.25 0.52
  86 quadratic asymtotic complexity
  87 0.23 0.32 0.28 0.49
  88 big oh efficiency n squared
  89 0.23 0.33 0.32 0.45
  90 computational complexity n squared
  91 0.22 0.36 0.38 0.40
  92 quadratic efficiency
  93 0.22 0.31 0.28 0.50
  94 quadratic algorithmic efficiency
  95 0.22 0.31 0.28 0.50
  96 quadratic bound
  97 0.21 0.30 0.29 0.50
  98 asymtotic growth of n squared
  99 0.21 0.28 0.24 0.55
 100 big oh growth rate n squared
 101 0.21 0.33 0.35 0.44
 102 time n squared
 103 0.21 0.27 0.22 0.57
 104 quadratic time efficiency
 105 0.21 0.29 0.28 0.51
 106 quadratic asymtotic run time
 107 0.20 0.27 0.25 0.54
 108 asymtotic run time n squared
 109 0.20 0.29 0.30 0.50
 110 growth rate n squared
 111 0.20 0.31 0.36 0.44
 112 asymtotic complexity n squared
 113 0.20 0.28 0.29 0.51
 114 big oh growth rate of n squared
 115 0.20 0.29 0.32 0.48
 116 quadratic asymtotic growth
 117 0.19 0.25 0.25 0.56
 118 time of n squared
 119 0.18 0.26 0.28 0.53
 120 asymtotic growth rate of n squared
 121 0.18 0.29 0.36 0.45
 122 quadratic asymtotic efficiency
 123 0.18 0.23 0.21 0.61
 124 algorithmic growth rate of n squared
 125 0.18 0.24 0.27 0.55
 126 computational growth rate of n squared
 127 0.18 0.28 0.38 0.45
 128 computational efficiency of n squared
 129 0.18 0.27 0.34 0.48
 130 quadratic computational efficiency
 131 0.17 0.22 0.22 0.61
 132 asymtotic growth n squared
 133 0.17 0.25 0.32 0.51
 134 quadratic big oh efficiency
 135 0.17 0.23 0.27 0.56
 136 bound of n squared
 137 0.17 0.28 0.40 0.43
 138 quadratic big oh growth rate
 139 0.16 0.23 0.31 0.54
 140 quadratic algorithmic growth rate
 141 0.15 0.22 0.30 0.54
 142 asymtotic bound n squared
 143 0.15 0.27 0.45 0.40
 144 computational growth rate n squared
 145 0.15 0.21 0.31 0.54
 146 quadratic asymtotic bound
 147 0.15 0.20 0.28 0.57
 148 asymtotic complexity of n squared
 149 0.14 0.20 0.31 0.55
 150 asymtotic efficiency of n squared
 151 0.14 0.21 0.33 0.53
 152 time growth rate of n squared
 153 0.14 0.19 0.28 0.58
 154 algorithmic efficiency n squared
 155 0.14 0.20 0.31 0.56
 156 efficiency n squared
 157 0.13 0.18 0.27 0.60
 158 asymtotic efficiency n squared
 159 0.13 0.18 0.29 0.58
 160 time efficiency n squared
 161 0.12 0.19 0.33 0.54
 162 algorithmic growth rate n squared
 163 0.12 0.17 0.28 0.60
 164 quadratic computational growth rate
 165 0.12 0.18 0.32 0.56
 166 growth n squared
 167 0.11 0.17 0.32 0.57
 168 quadratic asymtotic growth rate
 169 0.10 0.15 0.29 0.61
 170 bound n squared
 171 0.10 0.15 0.31 0.59
 172 time growth rate n squared
 173 0.10 0.13 0.20 0.70
 174 asymtotic growth rate n squared
 175 0.09 0.11 0.25 0.66
 176 computational efficiency n squared
 177 0.08 0.12 0.33 0.59