Can you write the running time functions (f(n)) in terms of n for the following function and its classification in ters of big-O asymptotic notation. Consider an operation to be variable assigment, data comparision,s arithmetic operations, and conditional statementsbool divisible_12_1(const std::vector<int>& vector){ if (vector.size() < 2) return false; bool d_4 = false; bool d_2 = false; bool d_3 = false; for (int n : vector) { if (n % 4 == 0) d_4 = true; else if (n % 2 == 0) d_2 = true; if (n % 3 == 0) d_3 = true; if ((d_2 && d_3) || (d_4 && d_3)) return true; } return false;}
Can you write the running time functions (f(n)) in terms of n for the following function and its classification in ters of big-O asymptotic notation. Consider an operation to be variable assigment, data comparision,s arithmetic operations, and conditional statementsbool divisible_12_1(const std::vector<int>& vector){ if (vector.size() < 2) return false; bool d_4 = false; bool d_2 = false; bool d_3 = false; for (int n : vector) { if (n % 4 == 0) d_4 = true; else if (n % 2 == 0) d_2 = true; if (n % 3 == 0) d_3 = true; if ((d_2 && d_3) || (d_4 && d_3)) return true; } return false;}
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Can you write the running time functions (f(n)) in terms of n for the following function and its classification in ters of big-O asymptotic notation. Consider an operation to be variable assigment, data comparision,s arithmetic operations, and conditional statements
bool divisible_12_1(const std::
if (vector.size() < 2) return false;
bool d_4 = false;
bool d_2 = false;
bool d_3 = false;
for (int n : vector) {
if (n % 4 == 0) d_4 = true;
else if (n % 2 == 0) d_2 = true;
if (n % 3 == 0) d_3 = true;
if ((d_2 && d_3) || (d_4 && d_3)) return true;
}
return false;
}
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 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education