bigger blocksize, curtoff for sort now 16

2 files changed, 4 insertions, 4 deletions

diff --git a/agenda_entry.c b/agenda_entry.c
index 137352d..985a8c0 100644
--- a/agenda_entry.c
+++ b/agenda_entry.c
@@ -71,11 +71,11 @@ char *format_entry(entry e) {
 void sort_entry_array(entry *arr, int n) {
     if (n == 1) return;
 
-    if (n <= 32) {
+    if (n <= 16) {
         insertion_sort_entry_array(arr, n);
     } else {
         int halfway = n/2;
-        if (halfway <= 32) {
+        if (halfway <= 16) {
             insertion_sort_entry_array(arr, halfway);
             insertion_sort_entry_array(arr+halfway, n - halfway);
         } else {
diff --git a/main.c b/main.c
index 8f2704e..4a953a1 100644
--- a/main.c
+++ b/main.c
@@ -2,7 +2,7 @@
 #include <unistd.h>
 #include <fcntl.h>
 #include "agenda_entry.h"
-#define BS 100 //blocksize for buffers
+#define BS 1024 //blocksize for buffers
 
 void destroy_entry_array(entry *array, int elements) {
     for (int i = 0; i < elements; i++)
@@ -18,7 +18,7 @@ char *read_file_to_buffer(char *filename) {
     char *buf = (char *)malloc(bufsize);
     char *newbuf;
 
-    while (read(fd, buf + bufread, 100) == BS) {
+    while (read(fd, buf + bufread, BS) == BS) {
         newbuf = (char *)malloc(bufsize + BS);
         strncpy(newbuf, buf, bufsize);
         free(buf);