Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Consider the following code: typedef unordered_map Table; bool matches(int k, int v, const Table& table) { auto pos = table.find(k); return (pos != table.end()) && (*pos == v); } int countMatches (const vector& keys, list values, const Table& table) { auto p1 = keys.begin(); auto p2 = values.begin(); int cnt = 0; while (p1 != keys.end() && p2 != values.end()) { if (matches(*p1, *p2, table)) ++cnt; ++p1; ++p2; } return cnt; } Let M, N, and K denote the size of keys, values, and table, respectively. What is the average case complexity of matches? O( ) What is the average case complexity of countMatches? O( )

Consider the following code: typedef unordered_map Table; bool matches(int k, int v, const Table& table) { auto pos = table.find(k); return (pos != table.end()) && (*pos == v); } int countMatches (const vector& keys, list values, const Table& table) { auto p1 = keys.begin(); auto p2 = values.begin(); int cnt = 0; while (p1 != keys.end() && p2 != values.end()) { if (matches(*p1, *p2, table)) ++cnt; ++p1; ++p2; } return cnt; } Let M, N, and K denote the size of keys, values, and table, respectively. What is the average case complexity of matches? O( ) What is the average case complexity of countMatches? O( )

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question

Consider the following code: typedef unordered_map<int,int> Table; bool matches(int k, int v, const Table& table) { auto pos = table.find(k); return (pos != table.end()) && (*pos == v); } int countMatches (const vector<int>& keys, list<int> values, const Table& table) { auto p1 = keys.begin(); auto p2 = values.begin(); int cnt = 0; while (p1 != keys.end() && p2 != values.end()) { if (matches(*p1, *p2, table)) ++cnt; ++p1; ++p2; } return cnt; } Let M, N, and K denote the size of keys, values, and table, respectively. What is the average case complexity of matches? O( ) What is the average case complexity of countMatches? O( )

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS