Se implementa zerogrouping sin uso de buffer (caracter a caracter). Esto mejora

[z.facultad/75.06/jacu.git] / src / blocksorting / bs.c

diff --git a/src/blocksorting/bs.c b/src/blocksorting/bs.c
index 64ea8ab45c50c764c84683e947d679847334a53f..9463b433401793f92ec978484180e3d5942e0590 100644 (file)
--- a/src/blocksorting/bs.c
+++ b/src/blocksorting/bs.c
@@ -100,8 +100,8 @@ void bs_solve(char *in, char *out, t_BlockSort *bs, unsigned long int *k, unsign
        (*k) = generar_salida(in, bs, out);
 
        /* Guardo el k y el tamaño en el array */
-       memcpy(out, k, sizeof(unsigned long int));
-       memcpy(out+sizeof(unsigned long int), &leido, sizeof(unsigned long int));
+       memcpy(out, &leido, sizeof(unsigned long int));
+       memcpy(out+sizeof(unsigned long int), k, sizeof(unsigned long int));
 
        bs->len = l;
 }