1) Add a FIRE command to main that will use your findEmployee function and the release employee. You will need to update releaseEmployee to have it remove the employee from the array as well as freeing the storage. It should set the slot to NULL. Make sure that LIST still works after firing an employee. 2) Define a sort function as below void sort(struct Employee * base[0, int n, int ("compareFunc)(struct Employee struct Employee **)) { qsort((void **)base,n,sizeof(void "),(int (*)(const void ",const void *))compareFunc); (You can copy this code directly into your code. You will need to have #include near the top of your file. You may need to change the 3 struct Employee to agree with the name you used for your struct.) Write two comparison functions for use in the sort routine. Each will take two parameters each having the type pointer to pointer to struct Employee and will return int (<0 for less than, 0 if equal, >0 if greater than). Each needs to handle the case where one or both pointers is NULL. Try to sort NULL to the end of the list. A)compareByName should compare the names of the employees using strcmp. B)compareBySalary should sort based on the salary of the two employees. Create a SALARY command that will sort by salary and then display the list and a NAME command that will sort by name and then display the list.
1) Add a FIRE command to main that will use your findEmployee function and the release employee. You will need to update releaseEmployee to have it remove the employee from the array as well as freeing the storage. It should set the slot to NULL. Make sure that LIST still works after firing an employee. 2) Define a sort function as below void sort(struct Employee * base[0, int n, int ("compareFunc)(struct Employee struct Employee **)) { qsort((void **)base,n,sizeof(void "),(int (*)(const void ",const void *))compareFunc); (You can copy this code directly into your code. You will need to have #include near the top of your file. You may need to change the 3 struct Employee to agree with the name you used for your struct.) Write two comparison functions for use in the sort routine. Each will take two parameters each having the type pointer to pointer to struct Employee and will return int (<0 for less than, 0 if equal, >0 if greater than). Each needs to handle the case where one or both pointers is NULL. Try to sort NULL to the end of the list. A)compareByName should compare the names of the employees using strcmp. B)compareBySalary should sort based on the salary of the two employees. Create a SALARY command that will sort by salary and then display the list and a NAME command that will sort by name and then display the list.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Please Implement your changes into the code I have provided in the link below
[This is the link to what I have so far]
https://onlinegdb.com/4P-DKN2qh
![1) Add a FIRE command to main that will use your findEmployee function and the
release employee.
You will need to update releaseEmployee to have it remove the employee from the
array as well as freeing the storage. It should set the slot to NULL.
Make sure that LIST still works after firing an employee.
2) Define a sort function as below
void sort(struct Employee * base], int n, int ("compareFunc)(struct Employee
struct Employee **))
**
{
qsort((void **)base,n,sizeof(void *),(int (*)(const void *,const void
*))compareFunc);
}
(You can copy this code directly into your code. You will need to have #include
<stdlib.h> near the top of your file. You may need to change the 3 struct Employee to
agree with the name you used for your struct.)
Write two comparison functions for use in the sort routine. Each will take two
parameters each having the type pointer to pointer to struct Employee and will return an
int (<0 for less than, 0 if equal, >0 if greater than).
Each needs to handle the case where one or both pointers is NULL. Try to sort NULLS
to the end of the list.
A)compareByName should compare the names of the employees using strcmp.
B)compareBySalary should sort based on the salary of the two employees.
Create a SALARY command that will sort by salary and then display the list and a
NAME command that will sort by name and then display the list.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F4855e6b1-f46c-47b1-9431-042023f8a12a%2Fb68f7af5-7fc4-43a4-bb10-ffec910ebb41%2F5oafe9m_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1) Add a FIRE command to main that will use your findEmployee function and the
release employee.
You will need to update releaseEmployee to have it remove the employee from the
array as well as freeing the storage. It should set the slot to NULL.
Make sure that LIST still works after firing an employee.
2) Define a sort function as below
void sort(struct Employee * base], int n, int ("compareFunc)(struct Employee
struct Employee **))
**
{
qsort((void **)base,n,sizeof(void *),(int (*)(const void *,const void
*))compareFunc);
}
(You can copy this code directly into your code. You will need to have #include
<stdlib.h> near the top of your file. You may need to change the 3 struct Employee to
agree with the name you used for your struct.)
Write two comparison functions for use in the sort routine. Each will take two
parameters each having the type pointer to pointer to struct Employee and will return an
int (<0 for less than, 0 if equal, >0 if greater than).
Each needs to handle the case where one or both pointers is NULL. Try to sort NULLS
to the end of the list.
A)compareByName should compare the names of the employees using strcmp.
B)compareBySalary should sort based on the salary of the two employees.
Create a SALARY command that will sort by salary and then display the list and a
NAME command that will sort by name and then display the list.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY