parallel arrays
Hi i'm learning the c++ programming language and i'm having problems with arrays. and i need help working on this problem i have below. if anyone can help that would be awesome.
Assume that empName and empID are two parallel arrays of size numEmp that hold employee data. Write an algorithm in pseudocode (no C++ statements) that sorts the empID array in ascending order, such that the two arrays remain parallel. That is, after sorting, for all indexes in the arrays, empName[index] must still be the name of the employee whose ID is in empID[index].
Assume that empName and empID are two parallel arrays of size numEmp that hold employee data. Write an algorithm in pseudocode (no C++ statements) that sorts the empID array in ascending order, such that the two arrays remain parallel. That is, after sorting, for all indexes in the arrays, empName[index] must still be the name of the employee whose ID is in empID[index].
What do you have so far? Just think of the arrays that are size numEmp as cells lined up next to each other. So when you move the data in cell empName, you need to move the data in empID as well to ensure they match.
Topic archived. No new replies allowed.