Optimized for both performance and memory gains

Author: Michael-Gkotsis

FileHandling.h

@@ -1,6 +1,7 @@
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>
+#include <string.h>
 
 // n = rows
 // dim = columns
@@ -10,11 +11,12 @@
 int getColumns(FILE*);
 int getRows(FILE*);
 
-double **getData(FILE*,int ,int ,double **);
+float *getData(FILE*,int ,int ,float *);
 void writeFile(FILE*,int,int,double **);
 double **transformPositive(int,int,double **);
 void qS(double *,int ,int);
 int partition(double *,int ,int);
+void qSort(float *,int);
 
 
 
@@ -148,20 +150,43 @@ int getColumns(FILE* Dataset)
 
   return dim;
 }
-double **getData(FILE* Dataset,int n,int dim,double **X)
+float *getData(FILE* Dataset,int n,int dim,float *X)
 {
   int i;
   int d;
   while(!feof(Dataset))
-   for (i = 0;  i < n; i++)
+   for (i = n; i--;)
    {
-       for (d = 0; d < dim; d++)
+       for (d = dim; d--;)
        {
-           fscanf(Dataset, "%lf,", &X[i][d]);
+           fscanf(Dataset, "%f", &X[i*dim + d]);
        }
    }
 
    return X;
 
 
 }
+
+
+
+void qSort(float *arr, int elements) {
+
+  #define  MAX_LEVELS  300
+
+  float  piv, beg[MAX_LEVELS], end[MAX_LEVELS],  swap ;
+  int i=0, L, R;
+  beg[0]=0; end[0]=elements;
+  while (i>=0) {
+    L=beg[i]; R=end[i]-1;
+    if (L<R) {
+      piv=arr[L];
+      while (L<R) {
+        while (arr[R]>=piv && L<R) R--; if (L<R) arr[L++]=arr[R];
+        while (arr[L]<=piv && L<R) L++; if (L<R) arr[R--]=arr[L]; }
+      arr[L]=piv; beg[i+1]=L+1; end[i+1]=end[i]; end[i++]=L;
+      if (end[i]-beg[i]>end[i-1]-beg[i-1]) {
+        swap=beg[i]; beg[i]=beg[i-1]; beg[i-1]=swap;
+        swap=end[i]; end[i]=end[i-1]; end[i-1]=swap; }}
+    else {
+      i--; }}}