Describe in English what func does, and what is guaranteed to be true (or not) after it runs. Don't just narrate the code; your description should be suitable for use in documentation. Analyse the function using your knowledge of vector and information you can find in STL library documentation. Using big-O notation, give the complexity of each marked line of code and of the method as a whole; on the five marked lines, say what it is that's taking up time and why it takes up the amount of time you specify, and for the function overall include a
Describe in English what func does, and what is guaranteed to be true (or not) after it runs. Don't just narrate the code; your description should be suitable for use in documentation. Analyse the function using your knowledge of vector and information you can find in STL library documentation. Using big-O notation, give the complexity of each marked line of code and of the method as a whole; on the five marked lines, say what it is that's taking up time and why it takes up the amount of time you specify, and for the function overall include a
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
![void func (vector<string>& names)
{
// (a)
sort (names.begin (), names.
for (int i = names.size ()
end ());
1; i > 0; --i) // (b) (whole loop)
{
if (names [i]
names [i-1])
// (c)
==
{
// (d)
// (e)
names [i]
= move(names.back());
names.pop_back();
}
}
}
Describe in English what func does, and what is guaranteed to be true (or
not) after it runs. Don't just narrate the code; your description should be
suitable for use in documentation.
Analyse the function using your knowledge of vector and information you
can find in STL library documentation. Using big-O notation, give the
complexity of each marked line of code and of the method as a whole; on
the five marked lines, say what it is that's taking up time and why it takes
up the amount of time you specify, and for the function overall include a
sentence saying how combining the other five answers gives you the result
you specify. Use n to represent the total size of the names vector that is
passed into the function.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9e0c3b52-81af-4354-8121-05bfc766aca3%2F40ad82a8-bb15-4580-bd07-efb4b5058a6e%2Feaa4d4_processed.png&w=3840&q=75)
Transcribed Image Text:void func (vector<string>& names)
{
// (a)
sort (names.begin (), names.
for (int i = names.size ()
end ());
1; i > 0; --i) // (b) (whole loop)
{
if (names [i]
names [i-1])
// (c)
==
{
// (d)
// (e)
names [i]
= move(names.back());
names.pop_back();
}
}
}
Describe in English what func does, and what is guaranteed to be true (or
not) after it runs. Don't just narrate the code; your description should be
suitable for use in documentation.
Analyse the function using your knowledge of vector and information you
can find in STL library documentation. Using big-O notation, give the
complexity of each marked line of code and of the method as a whole; on
the five marked lines, say what it is that's taking up time and why it takes
up the amount of time you specify, and for the function overall include a
sentence saying how combining the other five answers gives you the result
you specify. Use n to represent the total size of the names vector that is
passed into the function.
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 4 steps
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