#include #include #include #include #include #include "csort.h" int main(void) { /* Variable Declaration/Initialization */ FILE *infile; char list[MAX_LINES][STRINGLENGTH + 1]; int listsize = 9; int i; char inchar; int currentline; int currentchar; long begin; long end; long benchtime; begin = time(NULL); infile = fopen(INFILENAME, "r"); if (infile == NULL) { printf("File error.\n"); return FALSE; } currentline = 0; while (fscanf(infile, "%16s", list[currentline]) && currentline < MAX_LINES && !feof(infile)) { // printf("%s\n", list[currentline]); currentline++; } printf("currentline: %d", currentline); listsize = currentline; for (i = 0; i < listsize; i++) { padzero(list[i], STRINGLENGTH); } bubblesort(&list, listsize); for (i = 0; i < listsize; i++) { printf("%s\n", list[i]); } end = time(NULL); benchtime = end - begin; printf("currentline: %d", currentline); printf("Program took %ld seconds to run.\n", benchtime); } void padzero(char instr[STRINGLENGTH + 1], int length) { int current = strlen(instr); for (; current < STRINGLENGTH; current++) { instr[current] = ' '; } instr[STRINGLENGTH] = '\0'; } void bubblesort(char **inlist, int size) { int i, j; char *temp; int flipped = FALSE; for (i = size; i >= 0; i--) { for (j = 0; j < i; j++) { if (strcmp(inlist[j],inlist[j+1]) < 0) { temp = inlist[j]; inlist[j] = inlist[j+1]; inlist[j+1] = temp; flipped = TRUE; } } if (flipped == FALSE) { return; } } }