How do I sort a vector of strings based on another vector of strings w/o sort()

Question

0.00/5 (No votes)

See more:

So I'm trying to sort an vector <string> carInventory based on the order of a vector with 3 elements titled vector <string> promotionOrder.

Ex)

Input:
vector<string> carInventory {"mz", "my", "my", "mx", "mz", "mx", "my", "mz"}
vector<string> promotionOrder {"mz", "mx", "my"}

Output:
{"mz", "mz", "mz", "mx", "mx", "my", "my", "my"} //new carInventory

Here's the function:

vector<string> SortCar::sortCarInventory(vector<string> carInventory, 
vector<string> promotionOrder)

What I have tried:

Currently stuck thinking of a solution with a time complexity of O(N) and <pre>with constant auxiliary space complexity O(1)

Posted 7-Jun-22 22:33pm

Member 15666018

Updated 9-Oct-22 19:09pm

Add a Solution

Comments

CPallini 8-Jun-22 4:38am

I don't know any sorting algorithm warranting O(N).

Richard MacCutchan 8-Jun-22 4:43am

You cannot use a sort as the sort order is not fixed. You just need to iterate the promotionOrder list and find all the relevant car entries for each one.

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Daniel Pfeffer · Answer 1 · 2022-06-08T02:30:00

Richard has given you a solution of time complexity O(N*M), and auxillary space O(1), where M is the number of entries in the promotionOrder list.

This could be reduced to O(N) with auxiliary space O(M) if we create a hash map where the key is the value of the promotionOrder entry and the mapped value is the position in the promotionOrder table. A set of M counters is initialized to zeroes.

For each carInventory entry:
Look up the position in the hash map
Increment the number of cars in that position.

For all counters:
Insert (counter) entries of the appropriate type into the output.

Reducing the auxiliary space to O(1) is left as an exercise...

BernardIE5317 · Answer 2 · 2022-10-09T19:09:00

Solution 4

Simple. STL will sort it for you.

Posted 9-Oct-22 19:09pm

BernardIE5317