StatisticsCalculator.java 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269
  1. import java.util.ArrayList;
  2. import java.util.Collections;
  3. public class StatisticsCalculator {
  4. public static double max(ArrayList<Double> array)
  5. {
  6. double max = 0;
  7. for(double waarde : array){
  8. if(waarde > max){
  9. max = waarde;
  10. }
  11. }
  12. return max;
  13. }
  14. public static double min(ArrayList<Double> array)
  15. {
  16. double min = array.get(0);
  17. for(double waarde : array){
  18. if(waarde < min){
  19. min = waarde;
  20. }
  21. }
  22. return min;
  23. }
  24. public static double avg(ArrayList<Double> array)
  25. {
  26. double avg = 0;
  27. for(double waarde : array){
  28. avg += waarde;
  29. }
  30. avg /= array.size();
  31. return avg;
  32. }
  33. public static double median(ArrayList<Double> array2){
  34. ArrayList<Double> array = new ArrayList<Double>();
  35. for(double db : array2)
  36. {
  37. array.add(db);
  38. }
  39. Collections.sort(array); //sort the array
  40. double median = 0;
  41. int middle = array.size()/2; //calculate the middle of the array
  42. if (array.size()%2 == 1) { //check if the array is even or uneven
  43. median = array.get(middle);
  44. } else {
  45. median = (array.get(middle-1) + array.get(middle+1)) / 2;
  46. }
  47. return median;
  48. }
  49. public static double modus(ArrayList<Double> array){
  50. double maxValue = 0;
  51. int maxCount = 0;
  52. for (int i = 0; i < array.size(); ++i){ //cycle through every number in the array
  53. int count = 0;
  54. for (int j = 0; j < array.size(); ++j) {
  55. if (array.get(j) == array.get(i)){
  56. ++count;
  57. }
  58. }
  59. if (count > maxCount) { //if the count is bigger then the max count, it will be the temporary modus
  60. maxCount = count;
  61. maxValue = array.get(i);
  62. }
  63. }
  64. return maxValue;
  65. }
  66. public static double afwijking(ArrayList<Double> array){
  67. double mediaan = StatisticsCalculator.median(array);
  68. double afwijking = 0;
  69. for(double m :array){
  70. afwijking += (mediaan-m)*(mediaan-m);
  71. }
  72. afwijking /= array.size();
  73. afwijking = Math.sqrt(afwijking);
  74. return afwijking;
  75. }
  76. public static double graagDagen(ArrayList<Double> array)
  77. ArrayList<Double> avgTempDag = new ArrayList<Double>();
  78. int i = 0;
  79. double avgTemp = 0;
  80. //Breken de gemiddelde temperatuur per dag.
  81. for(double db : array)
  82. {
  83. i++;
  84. if(i%1440==0)
  85. {
  86. avgTempDag.add(avgTemp);
  87. avgTemp = 0;
  88. }
  89. avgTemp += db;
  90. }
  91. avgTemp /= array.size();
  92. int graaddagen = 0;
  93. int periodeBegin = 0;
  94. int periodeEind = 1439;
  95. for(int j = 0; j < avgTempDag.size(); j++)
  96. {
  97. if(avgTemp < 18)
  98. {
  99. graaddagen += 18 - avgTemp;
  100. }
  101. }
  102. periodeBegin += 1400;
  103. periodeEind += 1400;
  104. //graaddagen afronden
  105. return graaddagen;
  106. public static int[] langsteDroogstePeriode(ArrayList<Double> array)
  107. {
  108. return langsteDroogstePeriodeMetMax(array, 0);
  109. }
  110. public static int[] langsteDroogstePeriodeMetMax(ArrayList<Double> array, int maxNeerslag)
  111. {
  112. int[] index = new int[2];
  113. int index1 = 0;
  114. int index2 = 0;
  115. //Code
  116. index[0] = index1;
  117. index[1] = index2;
  118. return index;
  119. }
  120. public static int[] langsteRegenPeriode(ArrayList<Double> array)
  121. {
  122. int[] index = new int[2];
  123. int index1 = 0;
  124. int index2 = 0;
  125. //Code
  126. index[0] = index1;
  127. index[1] = index2;
  128. return index;
  129. }
  130. public static double maximaleRegenPeriode(ArrayList<Double> array)
  131. {
  132. double totaleRegen = 0;
  133. for(double db : array)
  134. {
  135. totaleRegen += db;
  136. }
  137. return totaleRegen;
  138. }
  139. public static int[] langsteZomersePeriode(ArrayList<Double> array)
  140. {
  141. ArrayList<Double> maxTempDag = new ArrayList<Double>();
  142. int i = 0;
  143. double maxTemp = 0;
  144. //Bereken de maximale temperatuur per dag.
  145. for(double db : array)
  146. {
  147. i++;
  148. if(i%1440==0)
  149. {
  150. maxTempDag.add(maxTemp);
  151. maxTemp = 0;
  152. }
  153. if(db > maxTemp)
  154. {
  155. maxTemp = db;
  156. }
  157. }
  158. //Creer een array met twee indexen
  159. int[] index = new int[2];
  160. int index1 = 0;
  161. int index2 = 0;
  162. //Een tijdelijke index om bij te houden wat de index was in het geval dat de vorige groter was.
  163. int index1_1 = 0;
  164. //Een boolean
  165. boolean zomers = false;
  166. int p = 0;
  167. int maxDays = 0;
  168. //Doorloop je maximale temperaturen en zoek de langste periode
  169. for(int t=0; t<maxTempDag.size(); t++) {
  170. if(maxTempDag.get(t) > 25) {
  171. p++;
  172. if(!zomers)
  173. {
  174. zomers = true;
  175. index1_1 = t;
  176. }
  177. }
  178. else {
  179. if(p > maxDays) {
  180. maxDays = p;
  181. index1 = index1_1;
  182. index2 = t-1;
  183. zomers=false;
  184. }
  185. p=0;
  186. }
  187. }
  188. //Het terugsturen van de gevonden indexen. Je doet ze keer 1440 omdat je bij het berekenen van
  189. //de temperatuur per dag je het in stukken van 1440 samenvoegde.
  190. index[0] = index1*1440;
  191. if(index2<0){index2=0;}
  192. index[1] = index2*1440;
  193. return index;
  194. }
  195. public static int[] langsteHitteGolfPeriode(ArrayList<Double> array)
  196. {
  197. int[] index = new int[2];
  198. int index1 = 0;
  199. int index2 = 0;
  200. //Code
  201. index[0] = index1;
  202. index[1] = index2;
  203. return index;
  204. }
  205. public static int[] langsteTempStijgingPeriode(ArrayList<Double> array)
  206. {
  207. int[] index = new int[2];
  208. int index1 = 0;
  209. int index2 = 0;
  210. //Code
  211. index[0] = index1;
  212. index[1] = index2;
  213. return index;
  214. }
  215. }