Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- THIS IS MY MAIN.C FILE!!!!!!!!!!!!!
- #include <stdio.h>
- #include <stdlib.h>
- #include "solution.h"
- #define DEBUG 1
- int main (void)
- {
- FILE *fp = NULL;
- int *allNum;
- int numLength, i, num;
- fp = fopen ("testcases.txt", "r");
- if (fp == NULL)
- {
- printf ("File is empty!\n");
- exit (1);
- }
- fscanf(fp, "%d", &numLength);
- #if DEBUG
- printf ("Numlength: %d\n", numLength);
- #endif
- allNum = malloc(sizeof(int)*numLength);
- for (i = 0; i < numLength; i++)
- {
- allNum[i] = readNextNum(fp);
- #if DEBUG
- printf ("Number %d is: %d\n", i, allNum[i]);
- #endif
- }
- printf ("Unsorted Array: ");
- printArray (allNum, numLength);
- #if DEBUG
- printf ("\nPrintArray is not a problem\n");
- #endif
- printf ("\nSorted Array: ");
- mySort (numLength, allNum);
- if (fscanf(fp, "%d", &num) != EOF)
- {
- numLength = moreNum(fp, allNum, numLength, num);
- printf ("\nNEW array: ");
- mySort (numLength, allNum);
- }
- else
- {
- printf ("\nThere are no other values in the file.\n");
- }
- fclose(fp);
- free (allNum);
- return 0;
- }
- THIS IS MY FUNCTIONS.C FILE ----------------------------------------------------------------------!!!!!!!!!!!!!!!!!!!!!!!!!!!
- /* Patrick Bryan
- * 0703010 */
- #include <stdio.h>
- #include <stdlib.h>
- #include "solution.h"
- /* Code taken from Judi lab2 */
- int readNextNum(FILE *fp)
- {
- int num;
- if (fp == NULL)
- {
- printf ("You are supposed to test the file pointer for null!\n");
- exit(1);
- }
- if (fscanf(fp, "%d", &num) != EOF)
- return (num);
- else
- {
- printf ("Scanned past the end of the file. Keep track of the length!\n");
- exit (1);
- }
- }
- void printArray (int *array, int length)
- {
- int i;
- for (i = 0; i < length; i++)
- printf ("%d ", array[i]);
- }
- int moreNum (FILE *fp, int *allNum, int numLength, int num)
- {
- numLength++;
- fp = realloc (fp, sizeof(int)*numLength);
- allNum[numLength-1] = num;
- if (fscanf(fp, "%d", &num) != EOF)
- {
- numLength = moreNum (fp, allNum, numLength, num);
- }
- return numLength;
- }
- void mySort (int numLength, int *allNum)
- {
- int biggestNum;
- int swapSpace;
- int j, i;
- #if DEBUG
- printf ("\nProgram has successfully entered mySort function\n");
- #endif
- /* Code taken from Quiz 1 */
- for(i=0; i<numLength; i++)
- {
- biggestNum = allNum[i];
- for(j=i; j<numLength; j++)
- {
- if (allNum[j] > biggestNum)
- biggestNum = allNum[j];
- }
- if (biggestNum != allNum[i])
- {
- swapSpace = biggestNum;
- biggestNum = allNum[i];
- allNum[i] = swapSpace;
- }
- }
- printArray (allNum, numLength);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement