Question

I forgot to include the programming language (It should be in the C language).

I need help in doing this program. Sample code will be greatly appreciated.

The program reads a file containing:

a. the number of integers to be sorted, followed by
b. the integers to be sorted (one integer per line) (must be the same with the indicated number of integers).

It will then be sorted out in another text file and a binary file from lowest to highest.

Other specs:

1. Use dynamic memory allocation

2. The format in the terminal should be:

   ./program.out  original-file.txt  output-file.txt  output-file.bin
   

where program.out is the program itself, original-file.txt is the text file which contains the number of integers to be sorted and the unsorted integers and the output-file.txt and output-file.bin contains the sorted integers.

Error checking:

1. check if malloc() was returned successfully

the original file will look like:

3 #number of integers to be sorted
3 #the integers-separated by new line
2
1

the output file:

3
1
2
3

Thank you very much in advance 🙂 God Bless!

Answer 1

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct tree {
  int num, cnt;
  struct tree *left, *right;
};
struct tree *add(struct tree *t, int val) {
  if (!t) {
    if (!(t = malloc(sizeof(struct tree))))
      perror("Not enough memory"), exit(-1);
    memset(t, 0, sizeof(struct tree));
    t->num = val;
    ++t->cnt;
    return t;
  }
  if (val < t->num)
    t->left = add(t->left, val);
  else if (val > t->num)
    t->right = add(t->right, val);
  else
    ++t->cnt;
  return t;
}
int walk(struct tree *t, int (*f)(struct tree *, void*), void *data) {
  int rc;
  if (!t)
    return 0;
  rc = walk(t->left, f, data);
  rc += f(t, data);
  rc += walk(t->right, f, data);
  return rc;
}
struct tree *clean(struct tree *t) {
  if (!t)
    return NULL;
  t->left = clean(t->left);
  t->right = clean(t->right);
  free(t);
  return NULL;
}
int save(struct tree *t, void *data) {
  int i, rc = 0;
  FILE *fp = (FILE *) data;
  for (i = 0; i < t->cnt; ++i)
    rc += (fprintf(fp, "%d\n", t->num) < 0);
  return rc;
}
int saveb(struct tree *t, void *data) {
  int i, rc = 0;
  FILE *fp = (FILE *) data;
  for (i = 0; i < t->cnt; ++i)
    rc += (fwrite((void *) &t->num, sizeof t->num, 1, fp) != 1);
  return rc;
}
int main(int argc, char **argv) {
  int rc = 0;
  struct tree *t = NULL;
  char buff[0x200];
  FILE *fin, *fout, *foutb;
  if (argc < 4) {
    fprintf(stderr, "Usage: %s SRCFILE OUTFILE.TXT OUTFILE.BIN\n", argv[0]);
    exit(0);
  }
  if (!((fin = fopen(argv[1], "r")) && (fout = fopen(argv[2], "w"))
        && (foutb = fopen(argv[3], "wb")))) {
    perror("fopen");
    exit(-1);
  }
  while (fgets(buff, sizeof buff, fin))
    t = add(t, atoi(buff));
  rc += walk(t, save, (void *) fout);
  rc += walk(t, saveb, (void *) foutb);
  t = clean(t);
  fclose(fin);
  fclose(fout);
  fclose(foutb);
  return rc;
}

Just noticed the “number of integers in first string of a file” spec; I think your teacher ment you’d put them into array and sort it; but anyway do it yourself 🙂

#include <stdio.h>
#include <stdlib.h>
int cmp(const void *a, const void *b) {
  return *(int*)a > *(int*)b ? 1 : (*(int*)a < *(int*)b ? -1 : 0);
}
int main(int argc, char **argv) {
  char buff[0x200];
  FILE *fin, *fout, *foutb;
  int i, *arr, sz = 0, rc = 0;
  if (argc < 4) {
    fprintf(stderr, "Usage: %s SRCFILE OUTFILE.TXT OUTFILE.BIN\n", argv[0]);
    exit(0);
  }
  if (!((fin = fopen(argv[1], "r")) && (fout = fopen(argv[2], "w"))
        && (foutb = fopen(argv[3], "wb")))) {
    perror("fopen");
    exit(-1);
  }
  if (fgets(buff, sizeof buff, fin)) {
    sz = atoi(buff);
    if (!(arr = malloc(sizeof(int) * sz)))
      perror("Not enough memory"), exit(-1);
    for (i = 0; i < sz && fgets(buff, sizeof buff, fin); ++i)
      arr[i] = atoi(buff);
  }
  qsort(arr, sz, sizeof(int), cmp);
  for (i = 0; i < sz; ++i)
    rc += (fprintf(fout, "%d\n", arr[i]) < 0);
  for (i = 0; i < sz; ++i)
    rc += (fwrite((void *) &arr[i], sizeof(int), 1, foutb) != 1);
  fclose(fin);
  fclose(fout);
  fclose(foutb);
  return rc;
}