Adding the C code.

I'm keeping the Java file for now as reference.

.gitignore

@@ -0,0 +1,8 @@
+# Ignore CMake files:
+CMakeCache.txt
+CMakeFiles/
+cmake_install.cmake
+Makefile
+
+# Ignore build files:
+build/

CMakeLists.txt

@@ -0,0 +1,13 @@
+cmake_minimum_required(VERSION 2.6)
+project(MMMCalc)
+
+set(CMAKE_C_FLAGS "-Wall -Wextra -pedantic-errors")
+set(CMAKE_C_FLAGS_DEBUG "${CMAKE_C_FLAGS} -g -O0")
+set(CMAKE_C_FLAGS_RELEASE "${CMAKE_C_FLAGS} -O3")
+set(CMAKE_C_FLAGS_RELWITHDEBINFO "${CMAKE_C_FLAGS} -g -O3")
+set(CMAKE_C_FLAGS_MIN_SIZEREL "${CMAKE_C_FLAGS} -Os")
+
+set(SRCS
+    src/Main.c)
+
+add_executable(mmmcalc ${SRCS})

README.md

@@ -1,6 +1,16 @@
 MMMCalc
 =======
 
-This is a very simple project, it was made for educational purposes (hence why it is open-source), and I encourage everyone to contribute if they have something to add.
+### Compiling
+MMMCalc uses [CMake](http://cmake.org/) to compile. Please install the C development tools and CMake (along with whichever build script you plan on having CMake generate) in order to run this command.
+```bash
+$ cd build/
+$ cmake ..
+$ make
+```
 
-To contact me, send me an e-mail at <nicolas.ortega.froysa@gmail.com>.
+### Contributing
+To contribute, simply open a pull request, however, be aware that this code is licensed under a GNU GPLv3 and so will yours.
+
+### License
+All code in this repository is under the [GNU GPLv3](/LICENSE).

src/Main.c

@@ -0,0 +1,14 @@
+#include <stdio.h>
+
+// 0 = false;
+// 1 = true;
+char version[16] = "v0.5";
+int verbose = 0;
+
+int main(int argc, char **argv) {
+    printf("MMMCalc %s, Copyright (c) 2016 Nicolás A. Ortega.\n", version);
+    printf("This program comes with ABSOLUTELY NO WARRANTY.\n");
+    printf("This program is free software and you are welcome to redistribute\n");
+    printf("under the terms and conditions of the GNU GPLv3 or higher.\n\n");
+    return 0;
+}

src/manifest.mf

@@ -1,2 +0,0 @@
-Manifest-Version: 0.2
-Main-Class: MMMCalc

src/mmmcalc/MMMCalc.java

@@ -1,3 +1,5 @@
+package mmmcalc;
+
 import java.lang.Math;
 import java.util.Arrays;
 import java.util.HashMap;
@@ -6,7 +8,7 @@ import java.util.Map;
 /**
  * @author Nicolás A. Ortega
  * @copyright (C) Nicolás A. Ortega
- * @license GNU General Public License 3.0 (GPLv3)
+ * @license GNU GPLv3
  * @year 2014
  * 
  */
@@ -14,14 +16,16 @@ public class MMMCalc {
 	private static boolean verbose = false;
 	private static float[] numArray;
 	private static float mean = 0;
+	private static float q1 = 0;
 	private static float median = 0;
+	private static float q3 = 0;
 	private static float mode = 0;
 	private static float range = 0;
 	private static float stdDev = 0;
 	private static float variance = 0;
 
 	public static void main(String[] args) {
-		System.out.println("MMMCalc v0.2, Copyright (C) 2014 Nicolás A. Ortega\n" +
+		System.out.println("MMMCalc v0.4, Copyright (C) 2014 Nicolás A. Ortega\n" +
 					"This program comes with ABSOLUTELY NO WARRANTY; for details use '-w'\n" +
 					"This is free software, and you are welcome to redistribute it\n" +
 					"under certain conditions; use '-c' for details.\n");
@@ -66,7 +70,9 @@ public class MMMCalc {
 				sortArray();
 
 				calcMean();
+				calcQ1();
 				calcMedian();
+				calcQ3();
 				calcMode();
 				calcRange();
 				calcStdDev();
@@ -80,7 +86,9 @@ public class MMMCalc {
 				sortArray();
 
 				calcMean();
+				calcQ1();
 				calcMedian();
+				calcQ3();
 				calcMode();
 				calcRange();
 				calcStdDev();
@@ -128,12 +136,142 @@ public class MMMCalc {
 		}
 	}
 
+	private static void calcQ1() {
+		int q1Pos;
+		// c stands for case... Cases correspond to their order in the following if statements (4 different cases).
+		int c;
+
+		if(numArray.length % 2.0 == 0) {
+			q1Pos = (int)(numArray.length / 4);
+			if(numArray.length % 4.0 == 0) {
+				q1 = (numArray[q1Pos] + numArray[q1Pos-1]) / 2;
+				c = 1;
+			} else {
+				q1 = numArray[q1Pos];
+				c = 2;
+			}
+		} else {
+			if(Math.ceil(numArray.length / 2.0) % 2.0 == 0) {
+				q1Pos = (int)(Math.ceil(numArray.length / 2.0) / 2.0);
+				q1 = (numArray[q1Pos] + numArray[q1Pos+1]) / 2;
+				c = 3;
+			} else {
+				q1Pos = (int)Math.ceil(numArray.length / 4.0);
+				q1 = numArray[q1Pos];
+				c = 4;
+			}
+		}
+
+		System.out.println("Q1: " + q1);
+
+		if(verbose) {
+			for(int i = 0; i < numArray.length; i++) {
+				if(c == 1) {
+					if(i == q1Pos - 1) {
+						System.out.print(">>" + numArray[i] + " !" + q1  + "! ");
+					} else if(i == q1Pos) {
+						System.out.print(numArray[i] + "<< ");
+					} else {
+						System.out.print(numArray[i] + " ");
+					}
+				} else if(c == 2) {
+					if(i == q1Pos) {
+						System.out.print(">>" + numArray[i] + "<< ");
+					} else {
+						System.out.print(numArray[i] + " ");
+					}
+				} else if(c == 3) {
+					if(i == q1Pos) {
+						System.out.print(">>" + numArray[i] + " !" + q1 + "! ");
+					} else if(i == q1Pos + 1) {
+						System.out.print(numArray[i] + "<< ");
+					} else {
+						System.out.print(numArray[i] + " ");
+					}
+				} else if(c == 4) {
+					if(i == q1Pos) {
+						System.out.print(">>" + numArray[i] + "<< ");
+					} else {
+						System.out.print(numArray[i] + " ");
+					}
+				}
+			}
+			System.out.print("\n\n");
+		}
+	}
+
 	private static void calcMedian() {
 		int midVar = numArray.length / 2;
+		boolean exact;
 
+		if(numArray.length % 2 == 0) {
+			median = (numArray[midVar] + numArray[midVar-1]) / 2;
+			exact = false;
+		} else {
 			median = numArray[midVar];
+			exact = true;
+		}
 
 		System.out.println("Median: " + median);
+
+		if(verbose) {
+			for(int i = 0; i < numArray.length; i++) {
+				if(!exact) {
+					if(i == midVar - 1) {
+						System.out.print(">>" + numArray[i] + " !" + median + "! ");
+					} else if(i == midVar) {
+						System.out.print(numArray[i] + "<< ");
+					} else {
+						System.out.print(numArray[i] + " ");
+					}
+				} else {
+					if(i == midVar) {
+						System.out.print(">>" + numArray[i] + "<< ");
+					} else {
+						System.out.print(numArray[i] + " ");
+					}
+				}
+			}
+			System.out.print("\n\n");
+		}
+	}
+
+	// FIXME: Needs to calculate haflway between the median value and the last value.
+	private static void calcQ3() {
+		/*int q3Pos = (numArray.length * 3) / 4;
+		boolean exact;
+
+		if((numArray.length * 3) % 4 != 0) {
+			q3 = (numArray[q3Pos+1] + numArray[q3Pos]) / 2;
+			exact = false;
+		} else {
+			q3 = numArray[q3Pos];
+			exact = true;
+		}
+
+		System.out.println("Q3: " + q3);
+
+		if(verbose) {
+			for(int i = 0; i < numArray.length; i++) {
+				if(!exact) {
+					if(i == q3Pos) {
+						System.out.print(">>" + numArray[i] + " !" + q3 + "! ");
+					} else if(i == q3Pos + 1) {
+						System.out.print(numArray[i] + "<< ");
+					} else {
+						System.out.print(numArray[i] + " ");
+					}
+				} else {
+					if(i == q3Pos) {
+						System.out.print(">>" + numArray[i] + "<< ");
+					} else {
+						System.out.print(numArray[i] + " ");
+					}
+				}
+			}
+			System.out.print("\n\n");
+		}*/
+		System.out.println("Q3 is not currently functional.\n");
 	}
 
 	private static void calcMode() {
@@ -159,6 +297,13 @@ public class MMMCalc {
 		}
 
 		System.out.println("Mode: " + mode + " (frequency: " + modeFreq + ")");
+
+		if(verbose) {
+			for(Map.Entry<Float, Float> entry:fx.entrySet()) {
+				System.out.print(entry.getKey() + "(" + entry.getValue() + ") ");
+			}
+			System.out.print("\n\n");
+		}
 	}
 
 	private static void calcRange() {
@@ -195,7 +340,6 @@ public class MMMCalc {
 	}
 
 	private static void calcVariance() {
-		// NOTE: I'm doing it this way so I don't have to convert the variables to doubles and lose precision.
 		variance = stdDev * stdDev;
 
 		System.out.println("Variance: " + variance);