> /*definition of the structure to be used, it is initialized as
an array containing 14 members.13 are to hold the provided info
and the 14th is to effect the structure bubbleSort*/
Well this is bad (awful actually)
Instead of messing with the last element of the array, declare a temp variable inside your sort function to take the place of employ[13]
The only performance drag is that bubble sort - which you should replace with the qsort in stdlib.h
The file handling is the only other expensive bit, but there's not much you can do about that
