c. Function pointers are always applied in comparing functions in sorting. If we would like to...

Transcribed Image Text:

c. Function pointers are always applied in comparing functions in sorting. If we would like to sort the student based on the ascending order of the student ID, what is the missing line(s)? typedef struct _student{ int SID; char name [80]; } Student; int sort_ascending_by_SID (const void student1, const void * student2) { // missing statement(s) for part c } int main() { } // some lines are skipped compare = sort_ascending_by_SID; // some lines are skipped d. Hence to (c), if we would like to sort the student based on the descending order of the lexicographical order of the name, write the function, sort_descending_by_name(), such that we can set the same compare pointer to this function. compare = sort_descending_by_name; c. Function pointers are always applied in comparing functions in sorting. If we would like to sort the student based on the ascending order of the student ID, what is the missing line(s)? typedef struct _student{ int SID; char name [80]; } Student; int sort_ascending_by_SID (const void student1, const void * student2) { // missing statement(s) for part c } int main() { } // some lines are skipped compare = sort_ascending_by_SID; // some lines are skipped d. Hence to (c), if we would like to sort the student based on the descending order of the lexicographical order of the name, write the function, sort_descending_by_name(), such that we can set the same compare pointer to this function. compare = sort_descending_by_name;

Answer rating: 100% (QA)

In part c youre asked to fill in the missing lines for the sortascendingbySID function which is inte... View the full answer