C Plus Plus Quiz
10 questions · no time limit
0:00
ALGORITHMS AND COMPLEXITY
Question 1 of 10
No time limit
Current
Answered
Flagged
Not seen
PASSAGE
Two vectors, workers and jobs, each contain nn integer skill or difficulty values. Every worker must be assigned to exactly one job. The total assignment cost is the sum of the absolute differences between each worker's skill and the assigned job's difficulty.
Which strategy uses sorting to obtain a minimum-cost assignment without examining all n!n! matchings?
YOUR PROGRESS
10
QUESTIONS
Ready when you are
Answer in any order. Your progress shows here as you go.
QUESTIONS
KEYBOARD
Pick an answer ABCD
Next question ↵→
Previous ←
Flag for review F
Answers save as you go · flagged questions come back at the end